enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. List of uniform polyhedra - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra

    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.

  3. List of uniform polyhedra by vertex figure - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra...

    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.

  4. Table of polyhedron dihedral angles - Wikipedia

    en.wikipedia.org/wiki/Table_of_polyhedron...

    Download as PDF; Printable version; In other projects ... The dihedral angles for the edge-transitive polyhedra are: Picture ... This page was last edited on 24 ...

  5. Vertex configuration - Wikipedia

    en.wikipedia.org/wiki/Vertex_configuration

    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 ...

  6. Euler characteristic - Wikipedia

    en.wikipedia.org/wiki/Euler_characteristic

    Vertex, edge and face of a cube. The Euler characteristic χ was classically defined for the surfaces of polyhedra, according to the formula = + where V, E, and F are respectively the numbers of vertices (corners), edges and faces in the given polyhedron. [2] Any convex polyhedron's surface has Euler characteristic

  7. Polyhedral graph - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_graph

    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]

  8. List of small polyhedra by vertex count - Wikipedia

    en.wikipedia.org/wiki/List_of_small_polyhedra_by...

    The smallest polyhedron is the tetrahedron with 4 triangular faces, 6 edges, and 4 vertices. Named polyhedra primarily come from the families of platonic solids, Archimedean solids, Catalan solids, and Johnson solids, as well as dihedral symmetry families including the pyramids, bipyramids, prisms, antiprisms, and trapezohedrons.

  9. Dual uniform polyhedron - Wikipedia

    en.wikipedia.org/wiki/Dual_uniform_polyhedron

    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]