Search results
Results From The WOW.Com Content Network
In geometry, a polyhedron (pl.: polyhedra or polyhedrons; from Greek πολύ (poly-) 'many' and ἕδρον (-hedron) 'base, seat') is a three-dimensional figure with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is a polyhedron that bounds a convex set.
A regular polyhedron is identified by its Schläfli symbol of the form {n, m}, where n is the number of sides of each face and m the number of faces meeting at each vertex. There are 5 finite convex regular polyhedra (the Platonic solids), and four regular star polyhedra (the Kepler–Poinsot polyhedra), making nine regular polyhedra in all. In ...
An n-dimensional polyhedron is a geometric object that generalizes the 3-dimensional polyhedron to an n-dimensional space. It is defined as a set of points in real affine (or Euclidean) space of any dimension n, that has flat sides. It may alternatively be defined as the intersection of finitely many half-spaces. Unlike a 3-dimensional ...
If only thirteen polyhedra are to be listed, the definition must use global symmetries of the polyhedron rather than local neighborhoods. In the aftermath, the elongated square gyrobicupola was withdrawn from the Archimedean solids and included into the Johnson solid instead, a convex polyhedron in which all of the faces are regular polygons. [16]
The regular dodecahedron is a polyhedron with twelve pentagonal faces, thirty edges, and twenty vertices. [1] It is one of the Platonic solids, a set of polyhedrons in which the faces are regular polygons that are congruent and the same number of faces meet at a vertex. [2]
This polyhedron is topologically related as a part of a sequence of cantellated polyhedra with vertex figure (3.4.n.4), which continues as tilings of the hyperbolic plane. These vertex-transitive figures have (*n32) reflectional symmetry .
If a polyhedron has Schläfli symbol {p, q}, then its dual has the symbol {q, p}. Indeed, every combinatorial property of one Platonic solid can be interpreted as another combinatorial property of the dual. One can construct the dual polyhedron by taking the vertices of the dual to be the centers of the faces of the original figure.
Schönhardt polyhedra have been used as gadgets in a proof that testing whether a polyhedron has a triangulation is NP-complete. Several other polyhedra, including Jessen's icosahedron, share with the Schönhardt polyhedron the properties of having no triangulation, of jumping or being shaky, or of forming a tensegrity structure.