Search results
Results from the WOW.Com Content Network
In geometry, a uniform polyhedron is a polyhedron which has regular polygons as faces and is vertex-transitive (transitive on its vertices, isogonal, i.e. there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent, and the polyhedron has a high degree of reflectional and rotational symmetry.
The relations can be made apparent by examining the vertex figures obtained by listing the faces adjacent to each vertex (remember that for uniform polyhedra all vertices are the same, that is vertex-transitive). For example, the cube has vertex figure 4.4.4, which is to say, three adjacent square faces.
Picture Name Schläfli symbol Vertex/Face configuration exact dihedral angle (radians) dihedral angle – exact in bold, else approximate (degrees) Platonic solids (regular convex)
This is an indexed list of the uniform and stellated polyhedra from the book Polyhedron Models, by Magnus Wenninger. The book was written as a guide book to building polyhedra as physical models. It includes templates of face elements for construction and helpful hints in building, and also brief descriptions on the theory behind these shapes.
In geometry, a vertex configuration is a shorthand notation for representing a polyhedron or tiling as the sequence of faces around a vertex. It has variously been called a vertex description , [ 1 ] [ 2 ] [ 3 ] vertex type , [ 4 ] [ 5 ] vertex symbol , [ 6 ] [ 7 ] vertex arrangement , [ 8 ] vertex pattern , [ 9 ] face-vector, [ 10 ] vertex ...
The illustration here shows the vertex figure (red) of the cuboctahedron being used to derive the corresponding face (blue) of the rhombic dodecahedron.. For a uniform polyhedron, each face of the dual polyhedron may be derived from the original polyhedron's corresponding vertex figure by using the Dorman Luke construction. [2]
If one relaxes the requirement that the graph be cubic, there are much smaller non-Hamiltonian polyhedral graphs. The graph with the fewest vertices and edges is the 11-vertex and 18-edge Herschel graph, [4] and there also exists an 11-vertex non-Hamiltonian polyhedral graph in which all faces are triangles, the Goldner–Harary graph. [5]
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces.