|
Cantellated Tesseract
In four-dimensional geometry, a cantellated tesseract is a convex uniform 4-polytope, being a cantellation (a 2nd order truncation) of the regular tesseract. There are four degrees of cantellations of the tesseract including with permutations truncations. Two are also derived from the 24-cell family. Cantellated tesseract The cantellated tesseract, bicantellated 16-cell, or small rhombated tesseract is a convex uniform 4-polytope or 4-dimensional polytope bounded by 56 cells: 8 small rhombicuboctahedra, 16 octahedra, and 32 triangular prisms. Construction In the process of cantellation, a polytope's 2-faces are effectively shrunk. The rhombicuboctahedron can be called a cantellated cube, since if its six faces are shrunk in their respective planes, each vertex will separate into the three vertices of the rhombicuboctahedron's triangles, and each edge will separate into two of the opposite edges of the rhombicuboctahedrons twelve non-axial squares. When the same process i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
4-cube T0
In geometry, a tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes. The tesseract is also called an 8-cell, C8, (regular) octachoron, octahedroid, cubic prism, and tetracube. It is the four-dimensional hypercube, or 4-cube as a member of the dimensional family of hypercubes or measure polytopes. Coxeter labels it the \gamma_4 polytope. The term ''hypercube'' without a dimension reference is frequently treated as a synonym for this specific polytope. The ''Oxford English Dictionary'' traces the word ''tesseract'' to Charles Howard Hinton's 1888 book ''A New Era of Thought''. The term derives from the Greek ( 'four') and from ( 'ray'), referring to the four edges from each vertex to other vertices. Hinton originally spelle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform 4-polytope
In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms. History of discovery * Convex Regular polytopes: ** 1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 6 regular polytopes in 4 dimensions and only 3 in 5 or more dimensions. * Regular star 4-polytopes (star polyhedron cells and/or vertex figures) ** 1852: Ludwig Schläfli also found 4 of the 10 regular star 4-polytopes, discounting 6 with cells or vertex figures and . ** 1883: Edmund Hess completed the list of 10 of the nonconvex regular 4-polytopes, in his book (in German) ''Einleitung in die Leh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Runcinated Tesseract
In four-dimensional geometry, a runcinated tesseract (or ''runcinated 16-cell'') is a convex uniform 4-polytope, being a runcination (a 3rd order truncation) of the regular tesseract. There are 4 variations of runcinations of the tesseract including with permutations truncations and cantellations. Runcinated tesseract The runcinated tesseract or (small) disprismatotesseractihexadecachoron has 16 tetrahedra, 32 cubes, and 32 triangular prisms. Each vertex is shared by 4 cubes, 3 triangular prisms and one tetrahedron. Construction The runcinated tesseract may be constructed by expanding the cells of a tesseract radially, and filling in the gaps with tetrahedra (vertex figures), cubes (face prisms), and triangular prisms (edge figure prisms). The same process applied to a 16-cell also yields the same figure. Cartesian coordinates The Cartesian coordinates of the vertices of the runcinated tesseract with edge length 2 are all permutations of: :\left(\pm 1,\ \pm 1,\ \pm 1,\ \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncated Tesseract
In geometry, a truncated tesseract is a uniform 4-polytope formed as the truncation of the regular tesseract. There are three truncations, including a bitruncation, and a tritruncation, which creates the ''truncated 16-cell''. Truncated tesseract The truncated tesseract is bounded by 24 cells: 8 truncated cubes, and 16 tetrahedra. Alternate names * Truncated tesseract (Norman W. Johnson) * Truncated tesseract (Acronym tat) (George Olshevsky, and Jonathan Bowers) Construction The truncated tesseract may be constructed by truncating the vertices of the tesseract at 1/(\sqrt+2) of the edge length. A regular tetrahedron is formed at each truncated vertex. The Cartesian coordinates of the vertices of a truncated tesseract having edge length 2 is given by all permutations of: :\left(\pm1,\ \pm(1+\sqrt),\ \pm(1+\sqrt),\ \pm(1+\sqrt)\right) Projections In the truncated cube first parallel projection of the truncated tesseract into 3-dimensional space, the image is laid out ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coxeter Group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 . Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. Standard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) varies his definition as convenient for the current area of discussion. Most of the following definitions of a vertex figure apply equally well to infinite tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square (geometry)
In Euclidean geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles (90-degree angles, π/2 radian angles, or right angles). It can also be defined as a rectangle with two equal-length adjacent sides. It is the only regular polygon whose internal angle, central angle, and external angle are all equal (90°), and whose diagonals are all equal in length. A square with vertices ''ABCD'' would be denoted . Characterizations A convex quadrilateral is a square if and only if it is any one of the following: * A rectangle with two adjacent equal sides * A rhombus with a right vertex angle * A rhombus with all angles equal * A parallelogram with one right vertex angle and two adjacent equal sides * A quadrilateral with four equal sides and four right angles * A quadrilateral where the diagonals are equal, and are the perpendicular bisectors of each other (i.e., a rhombus with equal diagonals) * A convex quadrilateral with successiv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangle
A triangle is a polygon with three Edge (geometry), edges and three Vertex (geometry), vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non-Collinearity, collinear, determine a unique triangle and simultaneously, a unique Plane (mathematics), plane (i.e. a two-dimensional Euclidean space). In other words, there is only one plane that contains that triangle, and every triangle is contained in some plane. If the entire geometry is only the Euclidean plane, there is only one plane and all triangles are contained in it; however, in higher-dimensional Euclidean spaces, this is no longer true. This article is about triangles in Euclidean geometry, and in particular, the Euclidean plane, except where otherwise noted. Types of triangle The terminology for categorizing triangles is more than two thousand years old, having been defined on the very first page of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular Prism
In geometry, a triangular prism is a three-sided prism; it is a polyhedron made of a triangular base, a translated copy, and 3 faces joining corresponding sides. A right triangular prism has rectangular sides, otherwise it is ''oblique''. A uniform triangular prism is a right triangular prism with equilateral bases, and square sides. Equivalently, it is a polyhedron of which two faces are parallel, while the surface normals of the other three are in the same plane (which is not necessarily parallel to the base planes). These three faces are parallelograms. All cross-sections parallel to the base faces are the same triangle. As a semiregular (or uniform) polyhedron A right triangular prism is semiregular or, more generally, a uniform polyhedron if the base faces are equilateral triangles, and the other three faces are squares. It can be seen as a truncated trigonal hosohedron, represented by Schläfli symbol t. Alternately it can be seen as the Cartesian product of a triangle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octahedron
In geometry, an octahedron (plural: octahedra, octahedrons) is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. A regular octahedron is the dual polyhedron of a cube. It is a rectified tetrahedron. It is a square bipyramid in any of three orthogonal orientations. It is also a triangular antiprism in any of four orientations. An octahedron is the three-dimensional case of the more general concept of a cross polytope. A regular octahedron is a 3-ball in the Manhattan () metric. Regular octahedron Dimensions If the edge length of a regular octahedron is ''a'', the radius of a circumscribed sphere (one that touches the octahedron at all vertices) is :r_u = \frac a \approx 0.707 \cdot a and the radius of an inscribed sphere (tangent to each of the octahedron's faces) is :r_i = \frac a \approx 0.408\cdot a while the midradius, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
