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

    Download QR code; Print/export ... Uniform polyhedra can be divided between convex forms with convex regular polygon faces and star forms. ... ⁠ 5 / 4 ⁠.10.5: I h ...

  3. Order-5 truncated pentagonal hexecontahedron - Wikipedia

    en.wikipedia.org/wiki/Order-5_truncated...

    The order-5 truncated pentagonal hexecontahedron is a convex polyhedron with 72 faces: 60 hexagons and 12 pentagons triangular, with 210 edges, and 140 vertices. Its dual is the pentakis snub dodecahedron. It is Goldberg polyhedron {5+,3} 2,1 in the icosahedral family, with chiral symmetry. The relationship between pentagons steps into 2 ...

  4. List of uniform polyhedra by vertex figure - Wikipedia

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

    There are many relations among the uniform polyhedra. [1] [2] [3] Some are obtained by truncating the vertices of the regular or quasi-regular polyhedron.Others share the same vertices and edges as other polyhedron.

  5. List of Johnson solids - Wikipedia

    en.wikipedia.org/wiki/List_of_Johnson_solids

    A convex polyhedron whose faces are regular polygons is known as a Johnson solid, or sometimes as a Johnson–Zalgaller solid [3]. Some authors exclude uniform polyhedra from the definition. A uniform polyhedron is a polyhedron in which the faces are regular and they are isogonal ; examples include Platonic and Archimedean solids as well as ...

  6. List of Wenninger polyhedron models - Wikipedia

    en.wikipedia.org/wiki/List_of_Wenninger...

    The polyhedra are grouped in 5 tables: Regular (1–5), Semiregular (6–18), regular star polyhedra (20–22,41), Stellations and compounds (19–66), and uniform star polyhedra (67–119). The four regular star polyhedra are listed twice because they belong to both the uniform polyhedra and stellation groupings.

  7. Eberhard's theorem - Wikipedia

    en.wikipedia.org/wiki/Eberhard's_theorem

    For an arbitrary convex polyhedron, one can define numbers , , , etc., where counts the faces of the polyhedron that have exactly sides. A three-dimensional convex polyhedron is defined to be simple when every vertex of the polyhedron is incident to exactly three edges.

  8. Blooming (geometry) - Wikipedia

    en.wikipedia.org/wiki/Blooming_(geometry)

    An early work on blooming by Biedl, Lubiw, and Sun from 1999 showed that some nets for non-convex but topologically spherical polyhedra have no blooming. [ 1 ] The question of whether every convex polyhedron admits a net with a blooming was posed by Robert Connelly , and came to be known as Connelly’s blooming conjecture . [ 2 ]

  9. Schläfli symbol - Wikipedia

    en.wikipedia.org/wiki/Schläfli_symbol

    See the six convex regular and 10 regular star 4-polytopes. For example, the 120-cell is represented by {5,3,3}. It is made of dodecahedron cells {5,3}, and has 3 cells around each edge. There is one regular tessellation of Euclidean 3-space: the cubic honeycomb, with a Schläfli symbol of {4,3,4}, made of cubic cells and 4 cubes around each edge.