|
Birectified 6-orthoplex
In six-dimensional geometry, a rectified 6-orthoplex is a convex uniform 6-polytope, being a rectification of the regular 6-orthoplex. There are unique 6 degrees of rectifications, the zeroth being the 6-orthoplex, and the 6th and last being the 6-cube. Vertices of the rectified 6-orthoplex are located at the edge-centers of the 6-orthoplex. Vertices of the birectified 6-orthoplex are located in the triangular face centers of the 6-orthoplex. Rectified 6-orthoplex The ''rectified 6-orthoplex'' is the vertex figure for the demihexeractic honeycomb. : or Alternate names * rectified hexacross * rectified hexacontitetrapeton (acronym: rag) (Jonathan Bowers) Construction There are two Coxeter groups associated with the ''rectified hexacross'', one with the C6 or ,3,3,3,3Coxeter group, and a lower symmetry with two copies of pentacross facets, alternating, with the D6 or 3,1,1Coxeter group. Cartesian coordinates Cartesian coordinates for the vertices of a rectified hex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
6-cube T5
In geometry, a 6-cube is a six-dimensional hypercube with 64 Vertex (geometry), vertices, 192 Edge (geometry), edges, 240 square Face (geometry), faces, 160 cubic Cell (mathematics), cells, 60 tesseract 4-faces, and 12 5-cube 5-faces. It has Schläfli symbol , being composed of 3 5-cubes around each 4-face. It can be called a hexeract, a portmanteau of tesseract (the ''4-cube'') with ''hex'' for six (dimensions) in Greek language, Greek. It can also be called a regular dodeca-6-tope or dodecapeton, being a 6-polytope, 6-dimensional polytope constructed from 12 regular Facet (geometry), facets. Related polytopes It is a part of an infinite family of polytopes, called hypercubes. The Dual polytope, dual of a 6-cube can be called a 6-orthoplex, and is a part of the infinite family of cross-polytopes. It is composed of various 5-cubes, at perpendicular angles on the u-axis, forming coordinates (x,y,z,w,v,u). Applying an ''Alternation (geometry), alternation'' operation, deleting ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rectified 5-simplex
In five-dimensional geometry, a rectified 5-simplex is a convex uniform 5-polytope, being a Rectification (geometry), rectification of the regular 5-simplex. There are three unique degrees of rectifications, including the zeroth, the 5-simplex itself. Vertices of the ''rectified 5-simplex'' are located at the edge-centers of the ''5-simplex''. Vertices of the ''birectified 5-simplex'' are located in the triangular face centers of the ''5-simplex''. Rectified 5-simplex In Five-dimensional space, five-dimensional geometry, a rectified 5-simplex is a uniform 5-polytope with 15 vertex (geometry), vertices, 60 Edge (geometry), edges, 80 Triangle, triangular Face (geometry), faces, 45 Cell (geometry), cells (30 Tetrahedron, tetrahedral, and 15 Octahedron, octahedral), and 12 4-faces (6 5-cell and 6 rectified 5-cells). It is also called 03,1 for its branching Coxeter-Dynkin diagram, shown as . Emanuel Lodewijk Elte, E. L. Elte identified it in 1912 as a semiregular polytope, labeling i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinates
In geometry, a Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of real numbers called ''coordinates'', which are the signed distances to the point from two fixed perpendicular oriented lines, called '' coordinate lines'', ''coordinate axes'' or just ''axes'' (plural of ''axis'') of the system. The point where the axes meet is called the '' origin'' and has as coordinates. The axes directions represent an orthogonal basis. The combination of origin and basis forms a coordinate frame called the Cartesian frame. Similarly, the position of any point in three-dimensional space can be specified by three ''Cartesian coordinates'', which are the signed distances from the point to three mutually perpendicular planes. More generally, Cartesian coordinates specify the point in an -dimensional Euclidean space for any dimension . These coordinates are the signed distances from the point to mutually perpendicular fixed h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Demihexeractic Honeycomb
The 6-demicubic honeycomb or demihexeractic honeycomb is a uniform space-filling tessellation (or honeycomb) in Euclidean 6-space. It is constructed as an alternation of the regular 6-cube honeycomb. It is composed of two different types of facets. The 6-cubes become alternated into 6-demicubes h and the alternated vertices create 6-orthoplex facets. D6 lattice The vertex arrangement of the 6-demicubic honeycomb is the D6 lattice. The 60 vertices of the rectified 6-orthoplex vertex figure of the ''6-demicubic honeycomb'' reflect the kissing number 60 of this lattice. The best known is 72, from the E6 lattice and the 222 honeycomb. The D lattice (also called D) can be constructed by the union of two D6 lattices. This packing is only a lattice for even dimensions. The kissing number is 25=32 (2n-1 for n8). : ∪ The D lattice (also called D and C) can be constructed by the union of all four 6-demicubic lattices: It is also the 6-dimensional body centered cubic, the union of ... [...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 general -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 conn ... [...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 avoid ... [...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; for example, the symmetry group of each regular polyhedron is a finite Coxeter group. 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dodecagon
In geometry, a dodecagon, or 12-gon, is any twelve-sided polygon. Regular dodecagon A regular polygon, regular dodecagon is a figure with sides of the same length and internal angles of the same size. It has twelve lines of reflective symmetry and rotational symmetry of order 12. A regular dodecagon is represented by the Schläfli symbol and can be constructed as a Truncation (geometry), truncated hexagon, t, or a twice-truncated triangle, tt. The internal angle at each vertex of a regular dodecagon is 150°. Area The area of a regular dodecagon of side length ''a'' is given by: :\begin A & = 3 \cot\left(\frac \right) a^2 = 3 \left(2+\sqrt \right) a^2 \\ & \simeq 11.19615242\,a^2 \end And in terms of the apothem ''r'' (see also inscribed figure), the area is: :\begin A & = 12 \tan\left(\frac\right) r^2 = 12 \left(2-\sqrt \right) r^2 \\ & \simeq 3.2153903\,r^2 \end In terms of the circumradius '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petrie Polygon
In geometry, a Petrie polygon for a regular polytope of dimensions is a skew polygon in which every consecutive sides (but no ) belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a regular polyhedron is a skew polygon such that every two consecutive sides (but no three) belongs to one of the faces. Petrie polygons are named for mathematician John Flinders Petrie. For every regular polytope there exists an orthogonal projection onto a plane such that one Petrie polygon becomes a regular polygon with the remainder of the projection interior to it. The plane in question is the Coxeter plane of the symmetry group of the polygon, and the number of sides, , is the Coxeter number of the Coxeter group. These polygons and projected graphs are useful in visualizing symmetric structure of the higher-dimensional regular polytopes. Petrie polygons can be defined more generally for any embedded graph. They form the faces of ano ... [...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 general -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 conn ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tetrahedron
In geometry, a tetrahedron (: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular Face (geometry), faces, six straight Edge (geometry), edges, and four vertex (geometry), vertices. The tetrahedron is the simplest of all the ordinary convex polytope, convex polyhedra. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean geometry, Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid (geometry), pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point. In the case of a tetrahedron, the base is a triangle (any of the four faces can be considered the base), so a tetrahedron is also known as a "triangular pyramid". Like all convex polyhedra, a tetrahedron can be folded from a single sheet of paper. It has two such net (polyhedron), nets. For any tetrahedron there exists a sphere (called th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octahedron
In geometry, an octahedron (: octahedra or octahedrons) is any polyhedron with eight faces. One special case is the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex. Many types of irregular octahedra also exist, including both convex set, convex and non-convex shapes. Combinatorially equivalent to the regular octahedron The following polyhedra are combinatorially equivalent to the regular octahedron. They all have six vertices, eight triangular faces, and twelve edges that correspond one-for-one with the features of it: * Triangular antiprisms: Two faces are equilateral, lie on parallel planes, and have a common axis of symmetry. The other six triangles are isosceles. The regular octahedron is a special case in which the six lateral triangles are also equilateral. * Tetragonal bipyramids, in which at least one of the equatorial quadrilaterals lies on a plane. The regular octahedron is a special case in which all thr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
