Search results
Results from the WOW.Com Content Network
The 5 Platonic solids are called a tetrahedron, hexahedron, octahedron, dodecahedron and icosahedron with 4, 6, 8, 12, and 20 sides respectively. The regular hexahedron is a cube . Table of polyhedra
There is a third topological polyhedral figure with 5 faces, degenerate as a polyhedron: it exists as a spherical tiling of digon faces, called a pentagonal hosohedron with Schläfli symbol {2,5}. It has 2 (antipodal point) vertices, 5 edges, and 5 digonal faces.
Vertex the (n−5)-face of the 5-polytope; Edge the (n−4)-face of the 5-polytope; Face the peak or (n−3)-face of the 5-polytope; Cell the ridge or (n−2)-face of the 5-polytope; Hypercell or Teron the facet or (n−1)-face of the 5-polytope
where φ = 1 + √ 5 / 2 is the golden ratio. Therefore, the circumradius of this rhombicosidodecahedron is the common distance of these points from the origin, namely √ φ 6 +2 = √ 8φ+7 for edge length 2. For unit edge length, R must be halved, giving R = √ 8φ+7 / 2 = √ 11+4 √ 5 / 2 ≈ 2.233.
Face, a 2-dimensional element; Cell, a 3-dimensional element; Hypercell or Teron, a 4-dimensional element; Facet, an (n-1)-dimensional element; Ridge, an (n-2)-dimensional element; Peak, an (n-3)-dimensional element; For example, in a polyhedron (3-dimensional polytope), a face is a facet, an edge is a ridge, and a vertex is a peak.
The quantity h (called the Coxeter number) is 4, 6, 6, 10, and 10 for the tetrahedron, cube, octahedron, dodecahedron, and icosahedron respectively. The angular deficiency at the vertex of a polyhedron is the difference between the sum of the face-angles at that vertex and 2 π .
[3] [5] [6] A face of dimension k is called a k-face. For example, the polygonal faces of an ordinary polyhedron are 2-faces. In set theory, the set of faces of a polytope includes the polytope itself and the empty set, where the empty set is for consistency given a "dimension" of −1. For any n-polytope (n-dimensional polytope), −1 ≤ k ≤ n.
Such a figure is called simplicial if each of its regions is a simplex, i.e. in an n-dimensional space each region has n+1 vertices. The dual of a simplicial polytope is called simple. Similarly, a widely studied class of polytopes (polyhedra) is that of cubical polyhedra, when the basic building block is an n-dimensional cube.