|
Birectified 6-orthoplex
In six-dimensional geometry, a rectified 6-orthoplex is a convex uniform 6-polytope, being a Rectification (geometry), 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 [4,3,3,3,3] Coxeter group, and a lower symmetry with two copies of pentacross facets, alternating, with the D6 or [33,1,1] Coxeter group. Cartesian coordinates Cartesian coordinates for the ... [...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. Applying an ''Alternation (geometry), alternation'' operation, deleting alternating vertices of the 6-cube, creates another uniform polytope, called a 6-demicube, (part of an infini ... [...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 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 geometry, a rectified 5-simplex is a uniform 5-polytope with 15 vertices, 60 edges, 80 triangular faces, 45 cells (30 tetrahedral, and 15 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 . E. L. Elte identified it in 1912 as a semiregular polytope, labeling it as S. Alternate names * Rectified hexateron (Acronym: rix) (Jonathan Bowers) Coordinates The vertices of the rectified 5-simplex can be more simply positioned on a hyp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinates
A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured in the same unit of length. Each reference coordinate line is called a ''coordinate axis'' or just ''axis'' (plural ''axes'') of the system, and the point where they meet is its ''origin'', at ordered pair . The coordinates can also be defined as the positions of the perpendicular projections of the point onto the two axes, expressed as signed distances from the origin. One can use the same principle to specify the position of any point in three-dimensional space by three Cartesian coordinates, its signed distances to three mutually perpendicular planes (or, equivalently, by its perpendicular projection onto three mutually perpendicular lines). In general, ''n'' Cartesian coordinates (an element of real ''n''-space) specify the point in an ' ... [...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 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] |
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] |
Dodecagon
In geometry, a dodecagon or 12-gon is any twelve-sided polygon. Regular dodecagon A 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 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 ''R'', the area is: :A = 6 \sin\left(\frac ... [...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 anothe ... [...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] |
Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra and the only one that has fewer than 5 faces. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of 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 nets. For any tetrahedron there exists a sphere (called the circumsphere) on which all four vertices lie, and another sphere ... [...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] |
.jpg "Click for more on -> Tetrahedron")