(dodecahedron) |
A polyhedron is
Name | Vertices | Edges | Faces | Edges/Face | Edges/Vertex | Symmetry group |
---|---|---|---|---|---|---|
Tetrahedron | 4 | 6 | 4 | 3 | 3 | Td |
Cube or hexahedron | 8 | 12 | 6 | 4 | 3 | Oh |
Octahedron | 6 | 12 | 8 | 3 | 4 | Oh |
Dodecahedron | 20 | 30 | 12 | 5 | 3 | Ih |
Icosahedron | 12 | 30 | 20 | 3 | 5 | Ih |
Note how these come in natural pairs: the dodecahedron with the icosahedron, the cube with the octahedron, and the tetrahedron with itself (ok, so that's not a pair). These are called duals, and can be obtained by connecting the midpoints of each other's faces, among other interesting things. There are also five regular polyhedral compounds.
If you allow the polyhedra to be non-convex, there are four more, called the Kepler-Poinsot solids.
Polyhedra which are vertex- and edge-uniform, but not necessarily face-uniform, are called quasi-regular and include two more convex forms (the cuboctahedron and icosidodecahedron, as well as a few non-convex forms. The duals of these are the edge- and face-uniform polyhedra: the rhombic dodecahedron, rhombic triacontahedron, plus whatever the non-convex ones are. No other convex edge-uniform polyhedra exist.
Any polyhedron which is vertex-uniform can be deformed slightly to form a vertex-uniform polyhedron with regular polygons as faces. These are called semi-regular polyhedra. Convex forms include two infinite series, one of prismss and one of antiprisms, as well as the thirteen Archimedean solids. The duals of these are of course the face-uniform polyhedra, with the two infinite convex series becoming the bipyramids and trapezohedra. These don't have regular faces, but do have regular vertices.
Another thing to consider is what kind of polyhedra, of any symmetry, can be made of regular polygons. There are an infinite number of non-convex forms, but surprisingly only a finite number of convex shapes other than the prisms and antiprisms. These include the Platonic solids, Archimedean solids, and 92 extra shapes called Johnson solids.
Given two polyhedra of equal volume, one may ask whether it is then always possible to cut the first into polyhedral pieces which can be reassembled to yield the second polyhedron. This is a version of Hilbert's third problem; the answer is "no", as was shown by Dehn in 1902.
See also: M. C. Escher