Search results
Results from the WOW.Com Content Network
Coxeter, Longuet-Higgins & Miller (1954) define uniform polyhedra to be vertex-transitive polyhedra with regular faces. They define a polyhedron to be a finite set of polygons such that each side of a polygon is a side of just one other polygon, such that no non-empty proper subset of the polygons has the same property.
The rhombicosidodecahedron shares its vertex arrangement with three nonconvex uniform polyhedra: the small stellated truncated dodecahedron, the small dodecicosidodecahedron (having the triangular and pentagonal faces in common), and the small rhombidodecahedron (having the square faces in common).
This is a degenerate uniform polyhedron rather than a uniform polyhedron, because some pairs of edges coincide. Not included are: The uniform polyhedron compounds. 40 potential uniform polyhedra with degenerate vertex figures which have overlapping edges (not counted by Coxeter); The uniform tilings (infinite polyhedra)
For example, in a polyhedron (3-dimensional polytope), a face is a facet, an edge is a ridge, and a vertex is a peak. Vertex figure : not itself an element of a polytope, but a diagram showing how the elements meet.
The vertex configuration of a uniform polyhedron, a generalization of the Schläfli symbol that describes the pattern of polygons surrounding each vertex, was devised in this book as a way to name the Archimedean solids, and has sometimes been called the Cundy–Rollett symbol as a nod to this origin. [9]
In geometry, a uniform 4-polytope (or uniform polychoron) [1] is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the ...
Coxeter–Dynkin diagrams for the fundamental finite Coxeter groups Coxeter–Dynkin diagrams for the fundamental affine Coxeter groups. In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing a Coxeter group or sometimes a uniform polytope or uniform tiling constructed from the group.
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]