Fact-checked by Grok 2 weeks ago

Star polyhedron

A star polyhedron is a non-convex in three-dimensional whose faces and vertex figures consist of regular polygons or star polygons, often exhibiting self-intersections and a repetitive star-like visual quality. These polyhedra generalize the concept of Platonic solids by allowing nonconvexity and self-intersections while maintaining regularity in their facial and vertex configurations. The four star polyhedra, collectively known as the Kepler–Poinsot polyhedra, represent the canonical examples: the with 12 pentagrammic faces, the with 12 pentagonal faces, the great stellated dodecahedron with 12 pentagrammic faces, and the great with 20 triangular faces. These were first described in part by in 1619 for two of the figures and fully enumerated by Louis Poinsot in 1809, completing the set of nine polyhedra when including the five solids. Each is characterized by congruent or star polygonal faces, identical vertex figures, and angles exceeding 180 degrees, ensuring a uniform symmetry under the icosahedral rotation group. Beyond the regular cases, star polyhedra encompass a broader class including both self-intersecting and non-self-intersecting varieties, such as star-domain polyhedra; star polyhedra, which are vertex-transitive with regular polygonal faces but may include greater than one due to intersections; and various stellations derived by extending the faces of polyhedra until they meet again. These structures, often denoted by Schläfli symbols such as {5/2, 5} for the , highlight the extension of classical polyhedral theory into nonconvex realms and have applications in , , and .

Fundamentals

Definition and Terminology

A star polyhedron is a three-dimensional whose faces consist of , represented using the {p/q}, where p and q are coprime positive integers with p > 2q > 2, allowing the structure to exhibit self-intersections or form non-convex star-shaped domains that deviate from simple convexity. Unlike convex polyhedra, where faces meet without crossing, star polyhedra incorporate the non-convex geometry of their star polygon faces, leading to complex spatial arrangements. The parameter q in {p/q} indicates the "step" or connection density in constructing the star polygon face, distinguishing it from convex polygons where q = 1. Star polyhedra are classified into two primary types: self-intersecting variants, characterized by a density greater than 1, and non-self-intersecting star-domain polyhedra, which possess a star-shaped kernel from which the entire interior is visible without obstruction. The density D generalizes the two-dimensional winding number to three dimensions, quantifying how many times the polyhedral surface winds around its interior; for self-intersecting cases, D > 1 reflects overlapping or crossing faces. A key prerequisite is the regular star polygon face {p/q}, whose face density D_f = q measures the integer winding number relative to a convex p-gon. The winding number further describes local intersections, ensuring the polyhedron's topological integrity despite apparent overlaps. Terminological conventions in star polyhedra draw from symmetry groups, with isohedral denoting face-transitive structures where all faces are equivalent under the polyhedron's , and isogonal indicating vertex-transitive properties where vertices are symmetrically interchangeable. For instance, the , denoted {5/2, 5}, exemplifies a star polyhedron that is both isohedral and isogonal, featuring pentagrammic faces meeting five at each vertex. These terms extend to broader classifications, such as uniform star polyhedra, which combine (possibly starred) faces with vertex transitivity. The Kepler–Poinsot polyhedra serve as archetypal examples of such self-intersecting star polyhedra.

Historical Development

The study of star polyhedra began in the early 17th century with Johannes Kepler's exploration of regular solids in his seminal work (1619), where he described the small and great stellated dodecahedra as non-convex extensions of the , noting their pentagrammic faces and self-intersecting structure. Kepler's discovery marked the first mathematical recognition of regular star polyhedra, integrating them into his cosmological framework linking geometry to planetary harmonies, though he did not fully enumerate all such forms. In the , advancements focused on systematic analysis and enumeration. Louis Poinsot independently rediscovered Kepler's and great stellated dodecahedron while investigating vertex figures, and he identified two additional regular star polyhedra: the and great icosahedron, published in his 1809 memoir on polyhedral symmetries. These findings expanded the known regular polyhedra beyond the five solids, emphasizing constructions via star polygons. further solidified their status in 1859 by naming Poinsot's figures and verifying their regularity through coordinate in his paper "On Poinsot's Four New Regular Solids." Earlier efforts, such as August Ferdinand Möbius's 1827 Der barycentrische Calcul, laid groundwork for barycentric coordinates that facilitated analysis, though Möbius's direct contributions to star polyhedra enumeration were more implicit in geometric transformations. The 20th century brought comprehensive classifications, particularly through H.S.M. Coxeter's work. In collaboration with M.S. Longuet-Higgins and J.C.P. Miller, Coxeter published "Uniform Polyhedra" in 1954, enumerating 75 uniform star polyhedra—vertex-transitive figures with regular polygonal faces, including non-convex and self-intersecting ones—building on earlier partial lists and proving near-completeness via symmetry groups. This classification, detailed in Coxeter's Regular Polytopes (first edition 1948, expanded later), integrated star polyhedra into higher-dimensional geometry, using tools like Schläfli symbols introduced by Ludwig Schläfli in 1852 for concise notation. Pre-20th-century studies, such as Poinsot's, overlooked many non-regular uniform star polyhedra due to limitations in computational verification and focus on convexity, leaving gaps until systematic group-theoretic approaches. Modern post-2000 computational methods have rediscovered overlooked non-orientable star polyhedra, such as certain hemi-polyhedra with odd Euler characteristics, through algorithmic enumerations that reveal embedding challenges in .
YearDiscoverer/PublicationKey Milestone
1619, Description of small and great stellated dodecahedra as the first regular star polyhedra.
1809Louis Poinsot, "Mémoire sur les polygones et polyèdres réguliers"Discovery of and ; rediscovery of Kepler's stars.
1827, Der barycentrische CalculIntroduction of barycentric methods aiding analysis.
1859, "On Poinsot's Four New Regular Solids" ()Naming and geometric verification of the four Kepler–Poinsot polyhedra.
1954H.S.M. Coxeter, M.S. Longuet-Higgins, J.C.P. Miller, "Uniform Polyhedra" (Philosophical Transactions of the Royal Society)Enumeration of 75 uniform star polyhedra, establishing modern classification.

Self-Intersecting Star Polyhedra

Kepler–Poinsot Polyhedra

The Kepler–Poinsot polyhedra are four regular self-intersecting polyhedra that extend the classical Platonic solids by incorporating star polygon faces or vertex figures, forming the complete set of nine regular polyhedra in . These polyhedra are defined by Schläfli symbols of the form {p/q, r}, where the fractional density q > 1 introduces self-intersections, and they satisfy the condition \frac{1}{q} + \frac{1}{r} > \frac{1}{2} to ensure a finite, spherical topology analogous to the convex regulars. Unlike the Platonic solids, their intersecting faces result in higher densities, yet they maintain full regularity with identical regular polygonal faces meeting identically at each vertex. The four polyhedra, along with their Schläfli symbols, Wythoff constructions (which generate them via mirror reflections in the icosahedral Coxeter plane), and combinatorial data, are summarized below. All share 30 edges and exhibit the full I_h of order 120, isomorphic to A_5 \times \mathbb{Z}_2, ensuring isogonal, isohedral, and isotoxal properties.
PolyhedronSchläfli SymbolWythoff SymbolVertices (V)Edges (E)Faces (F)
Small stellated dodecahedron{5/2, 5}5 | 5/2 5123012
Great dodecahedron{5, 5/2}5/2 | 5 5123012
Great stellated dodecahedron{5/2, 3}3 | 5/2 5203012
Great icosahedron{3, 5/2}5/2 | 3 5123020
The features 12 pentagrammic faces {5/2}, with five meeting at each , appearing as a stellated when viewed externally. Its , the , has 12 pentagonal faces with pentagrammic figures, where five faces intersect at each in a more compact, inward-pointing form. Similarly, the great stellated dodecahedron consists of 12 pentagrammic faces with triangular figures, enclosing a dodecahedral core, while its , the great , comprises 20 triangular faces with pentagrammic figures, manifesting as a starred around an . These dual pairs interchange faces and vertices while preserving the 30 edges, highlighting their reciprocal geometric relationship. Visualizations often depict them as compound-like structures due to intersections, but each is a single, orientable surface with greater than zero.

Uniform Star Polyhedra

Uniform star polyhedra are self-intersecting that are vertex-transitive, meaning all are equivalent under the polyhedron's , and composed of regular faces with corresponding regular (possibly star) . The is the spherical formed by the intersection of the polyhedron with a small centered at a , reflecting the arrangement of faces meeting at that . The enumeration of uniform polyhedra, encompassing both and varieties, totals 75 non-prismatic examples, alongside infinite families of uniform prisms and antiprisms. This complete list was established by J. Skilling in 1975 using algebraic methods based on groups, confirming and extending prior work such as the 1954 enumeration by H. S. M. Coxeter, M. S. Longuet-Higgins, and J. C. P. Miller, who identified 53 non-regular uniform polyhedra in addition to 18 uniforms. Skilling's approach resolved potential incompletenesses by systematically generating all possibilities from the relevant finite rotation groups. Of the 75, 57 are self-intersecting uniform polyhedra, comprising the 4 regular Kepler–Poinsot polyhedra and the 53 non-regular ones. These star polyhedra are categorized by their groups, which are conjugate subgroups of the tetrahedral ( × Z2), octahedral (S4 × Z2), or icosahedral (A5 × Z2) full rotation groups, and further by and . Many appear in chiral pairs, such as the snub forms, where left- and right-handed enantiomorphs exist with the same but opposite orientations; examples include the snub dodecadodecahedron. Regarding , most are orientable surfaces, but certain realizations, like some hemi-polyhedra, can be non-orientable due to their topological and self-intersections. The dodecadodecahedron (Wenninger U36) exemplifies an icosahedral star polyhedron with 4 and (5/2.10.5/2.10). Vertex configurations for uniform star polyhedra are denoted using a sequence of numbers representing the number of sides of the faces meeting at a , with fractions p/q indicating star polygons {p/q} where q > 1 denotes the of the winding. For instance, the great dirhombicosidodecahedron has vertex configuration (3.5/2.5/2), signifying a , a {5/2}, and a {5/2} (retrograde pentagram) around each . These configurations ensure edge lengths are and symmetries are preserved. The following table summarizes representative uniform star polyhedra, including the 4 regular Kepler–Poinsot polyhedra and selected non-regular examples, with Schläfli-like symbols (for regulars) or vertex configurations (for non-regulars), face types, and face densities (measuring the of faces through space). Densities greater than 1 reflect self-intersections.
Index (Wenninger)NameSymbol/ConfigurationFace TypesDensity
U05{5/2,5}12 pentagrams3
U06{5,5/2}12 pentagons3
U07Great stellated dodecahedron{5/2,3}12 pentagrams7
U08Great icosahedron{3,5/2}20 triangles3
U24Dodecadodecahedron(5/2.10.5/2.10)12 pentagons, 12 pentagrams, 20 hexagons4
U29Great dirhombicosidodecahedron(3.5/2.5/2)20 triangles, 30 squares, 12 pentagrams, 12 decagons10
U44Great snub icosidodecahedron (chiral pair)(3.4.3.4.5/2)80 triangles, 12 pentagrams47
This selection highlights icosahedral symmetries; the full set includes octahedral and tetrahedral examples, with densities ranging from 3 to 91 for the most intersecting forms like the great snub icosidodecahedron.

Stellations and Facetings

Stellation is the geometric process of extending the planes of a 's faces until they intersect to form a larger, often self-intersecting with star-shaped elements. This method, which generates star polyhedra from "seed" , was defined by in in his , where he applied it to the to produce the , the first documented star polyhedron. The features 12 regular pentagrammic faces that intersect, demonstrating how transforms a into a non- form while maintaining the original face plane orientations. Faceting, the complementary technique to stellation, constructs star polyhedra by selecting subsets of the seed polyhedron's vertices or edges and defining new faces via planes that pass through these points, effectively creating intersecting facets without extending the original faces. For example, the ditrigonal dodecadodecahedron emerges from faceting a , yielding 24 faces comprising 12 pentagons and 12 pentagrams that interpenetrate in a arrangement. Unlike stellation, which builds outward from face planes, faceting reconfigures the interior by imposing new bounding planes, often leading to denser intersections near the seed's vertices. Systematic enumeration of stellations advanced significantly with H.S.M. Coxeter's 1938 stellation diagram, a graphical method that maps the intersection lines of extended face planes for the , enabling the identification of its 59 valid stellations by excluding invalid "holes" and compounds. Coxeter's approach formalized the selection criteria for complete polyhedra, ensuring only bounded, connected forms without gaps. In 1971, Magnus J. Wenninger expanded on these techniques in his catalog of 75 uniform star polyhedra, many derived from iterative applications of and to and Archimedean seeds, providing construction templates for physical models. The core of stellation computation lies in determining the cells formed by intersecting extended face planes, often implemented via ray-tracing from an interior kernel point to trace intersections with each plane, thereby delineating bounded regions that constitute the new faces. Early manual methods, like Coxeter's diagram, were constrained by the need to visually resolve complex plane arrangements, limiting discoveries to symmetric cases and occasionally missing non-convex variants. Post-2000 software such as Stella4D addresses these shortcomings through automated plane intersection algorithms, facilitating exhaustive enumeration even for non-convex seeds and uncovering previously overlooked stellations that manual techniques deemed impractical. Fundamentally, retains the original face plane types but introduces self-intersections as extensions meet, whereas generates novel vertex figures by routing new planes through existing points, altering the local geometry around vertices without preserving the seed's face extensions. These processes collectively produce the uniform star polyhedra, bridging origins to intricate non-convex forms.

Higher-Dimensional Star Polyhedra

Star polytopes generalize the concept of star polyhedra to dimensions greater than three, featuring cells or facets described by fractional Schläfli symbols of the form {p/q} where q > 1, resulting in self-intersecting structures with positive greater than one. These higher-dimensional analogues maintain regularity when all elements—facets, ridges, and vertex figures—are congruent and the symmetry group acts transitively on flags, but allow for non-convexity and intersections akin to their three-dimensional counterparts. In n dimensions, the Schläfli symbol extends to {p_1/q_1, p_2/q_2, \dots, p_{n-1}/q_{n-1}}, where each satisfies density conditions (q_i > 1 for starring) to ensure finite, bounded figures without degenerating into tilings. In four dimensions, star polytopes are known as polychora, with 10 regular examples enumerated as the Schläfli–Hess polychora, all derived from stellations, duals, or compounds of the 120-cell and . Notable instances include the great 120-cell {5,5/2,3}, composed of 120 great dodecahedral cells meeting five around each ridge, and the small stellated 120-cell {5/2,5,3}, its dual. H.S.M. Coxeter provided the foundational classification of these regular 4D polytopes, including the variants, in his 1948 work updated in 1973, confirming no additional regular or polychora exist beyond the 16 total regulars (6 , 10 ). Uniform star polychora, which are vertex-transitive with uniform polyhedral cells but not necessarily regular, number over 2,000 finite examples as of recent counts, far exceeding the three-dimensional case of 57 non-prismatic polyhedra. Unique to higher dimensions, properties like s—skew cycles that alternate between two orthogonal directions—play a key role in characterizing star polytopes, often forming the boundaries of their figures, which are themselves three-dimensional polytopes. For instance, the of the great is a , reflecting its icosahedral symmetry. In dimensions beyond four, no finite regular star polytopes exist; instead, infinite families arise as regular star honeycombs in or spaces, such as the order-5 dodecahedral honeycomb {5,3,5,3} with starring variants. Traditional enumerations, like Coxeter's focus on regulars, overlook the vast non-uniform star polychora, but 2020s computational efforts using symmetry-detection software such as Miratope have expanded the , discovering dozens of new and scaliform examples through exhaustive generation from Coxeter-Dynkin diagrams and recursion, bringing the total to 2,191 polychora by 2023 with ongoing additions.

Non-Self-Intersecting Star Polyhedra

Star-Domain Polyhedra

Star-domain polyhedra, also referred to as star-shaped polyhedra, are non-convex polyhedra whose interiors form star-shaped domains, meaning they possess a non-empty —a set of interior points from which every point on the is visible via a lying entirely within the —while exhibiting no intersections between edges or faces. This condition ensures that for any point K in the kernel and any boundary point B, the line segment KB remains inside the polyhedron, distinguishing these structures from more general non-convex forms that may lack such a kernel. Unlike self-intersecting star polyhedra, which feature crossing surfaces and higher topological densities, star-domain polyhedra maintain a without such overlaps, emphasizing geometric over intersectional complexity. These polyhedra are simply connected, topologically equivalent to a sphere with genus 0, and satisfy the Euler characteristic \chi = V - E + F = 2, where V, E, and F denote the numbers of vertices, edges, and faces, respectively, consistent with their orientable, closed surface topology. A representative example is Jessen's orthogonal icosahedron, introduced in 1967, which consists of 12 vertices, 30 edges, and 20 triangular faces—eight equilateral and twelve isosceles—formed by indenting pairs of adjacent triangles in a regular icosahedron to create concave regions while preserving central visibility and pyritohedral symmetry. Another class includes non-convex deltahedra that introduce concavities without self-intersection, maintaining all equilateral triangular faces and a visible kernel. Construction of star-domain polyhedra often involves indenting the faces of a convex , such as pushing in portions of a regular 's surface to form pockets or depressions, provided the modifications do not cause edges to cross or obscure the ; for instance, selective valley folds in an net can yield a non-convex form with sustained star-shaped properties. While classical examples like Jessen's illustrate these principles, post-2000 research in has focused on algorithmic generation of star-domain approximations optimized for applications such as , where non-empty kernels facilitate efficient filling via rotational gravity casting, though exhaustive catalogs of such forms remain underdeveloped.

Inductive and Retrograde Examples

Inductive construction provides a method for generating non-self-intersecting star polyhedra by beginning with a convex polyhedron and iteratively denting faces inward, ensuring no self-intersections occur. This process typically involves replacing a portion of a face with a pyramidal indentation, as seen in the indented , where pyramidal dents are added to each of the six square faces of a , resulting in a nonconvex form with star-like appearance while maintaining a non-empty . A classic example is the set of inductive cubes obtained by varying the depth and position of dents on the cube while preserving octahedral symmetry. Retrograde polyhedra represent another family of non-self-intersecting star polyhedra, constructed by reversing the orientation of facets on a base polyhedron to create star-like silhouettes without intersections. These constructions produce inward folds that mimic stellar points, with examples exhibiting octahedral or icosahedral symmetry. These constructions highlight the geometric properties of non-self-intersecting star polyhedra, with all examples sharing full octahedral or icosahedral symmetry groups. In the 2020s, algorithmic methods have extended these approaches to generate star-domain polyhedra of arbitrary genus, using computational tools to iteratively apply dents and orientation reversals while verifying non-intersection and kernel existence.

Geometric and Topological Properties

Density and Winding Numbers

In self-intersecting star polyhedra, and winding numbers serve as key topological invariants that quantify the extent and multiplicity of intersections, providing a measure of the figure's complexity beyond simple convexity. The generalizes the two-dimensional winding number to three dimensions, capturing how the polyhedral surface overlaps itself to enclose the interior multiple times. For a star polygon face with {p/q}, where p and q are coprime positive integers and 1 < q < p/2, the face D_f equals q, indicating the number of times the face boundary winds around its center before closing. The vertex density is defined analogously for the vertex figure {q/r} as r. The overall D of the polyhedron represents the average number of surface windings enclosing a generic interior point. The winding number at an interior point is the integer-valued count of the distinct surface layers that enclose it, reflecting local intersection multiplicity. For instance, the small stellated dodecahedron \{5/2, 5\} has an overall density D = 3, meaning its surface forms three overlapping layers around the center. To compute the winding number, consider a ray emanating from the interior point to infinity; the total number of face intersections along the ray equals twice the winding number for an orientable closed surface, as each layer contributes two crossings (entry and exit). Orientability is assessed by the parity of these crossings modulo 2: even parity indicates a two-sided (orientable) surface, while odd parity signals a one-sided (non-orientable) surface. These concepts integrate into the Euler-Poincaré formula modified for density, which relates the combinatorial structure to the topology: \chi = V - E + F = 2(1 - g)D where \chi is the Euler characteristic, V, E, and F are the numbers of vertices, edges, and faces, g is the genus of the underlying surface, and D is the overall density. This adjustment accounts for the effective multiplicity of the self-intersecting surface, treating it as D parallel sheets of a higher-genus manifold. Density and winding numbers enable practical distinctions among polyhedral configurations: genuine star polyhedra exhibit positive (D > 0), enclosing a well-defined interior, whereas compounds of multiple disjoint polyhedra have density (D = 0) due to the absence of a unified enclosing surface. They also highlight non-orientable examples.

Euler Characteristic and Orientability

The Euler characteristic of a polyhedron, denoted χ, is computed as χ = V - E + F, where V is the number of vertices, E the number of edges, and F the number of faces. For simple convex polyhedra topologically equivalent to a , χ equals 2. In the case of star polyhedra, self-intersections alter the topological structure, resulting in χ ≠ 2; the value reflects the underlying surface's complexity rather than a spherical topology. Self-intersections in star polyhedra necessitate adjustments to the Euler characteristic to account for densities introduced by overlapping elements. H. S. M. Coxeter formalized density as a measure of how faces wind around the polyhedron's interior, leading to a density-weighted interpretation of χ that aligns with the polyhedron's effective topology. For instance, the great dodecahedron has V = 12, E = 30, F = 12, yielding χ = -6, with a density of 3; this corresponds to a genus g = 2 surface, computed via the formula for orientable closed surfaces adjusted for density, g = 1 - χ/(2D). Star polyhedra exhibit properties akin to general surfaces: orientable ones allow consistent orientation of faces (two-sided), while non-orientable ones do not (one-sided, like a ). Most uniform star polyhedra are orientable, but non-orientable examples exist, such as the tetrahemihexahedron (a with 4 triangular faces, 3 square faces, 4 vertices, and 6 edges, giving χ = 5). The genus formula g = 1 - χ/(2D) applies to orientable star polyhedra and captures the handle count of the bounding surface adjusted for density. Non-orientable uniform star polyhedra remain underexplored in physical realizations, with advancements in 3D printing after 2010 enabling models of such structures, though comprehensive documentation lags.

References

  1. [1]
    [PDF] The Stars Above Us: - Harvard Math
    In 3d, there are star polyhedra. This small stellated dodecahedron (sissid for short11) is a regular star polyhedron made up of 12 regular pentagrams. There are ...
  2. [2]
    Regular Star-Polyhedra - SpringerLink
    Sep 6, 2017 · A regular polyhedron is by definition a convex polyhedron such that its faces and vertex figures are congruent regular polygons.
  3. [3]
    (IUCr) Star polyhedra
    Nov 11, 2022 · A polyhedron is convex if every dihedral angle is smaller than 180°. The dihedral angle is the angle formed by two polygons joined along a ...
  4. [4]
    Schläfli Symbol -- from Wolfram MathWorld
    A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts.
  5. [5]
    Star Polygon -- from Wolfram MathWorld
    A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points ...
  6. [6]
    Star Polyhedron -- from Wolfram MathWorld
    A star polyhedron is a nonconvex polyhedron which contains an arrangement of symmetrically (nor nearly symmetrically) arranged spikes.
  7. [7]
    The Densities of the Regular Polytopes - Cambridge University Press
    Oct 24, 2008 · In this paper it is shown how all the regular polytopes (including the Kepler-Poinsot polyhedra and Hess's analogous star polytopes in four ...
  8. [8]
    Polygon Density -- from Wolfram MathWorld
    The number q in a star polygon {p/q}.
  9. [9]
    [PDF] On Infinite Kepler-Poinsot Polyhedra Abstract - The Bridges Archive
    Those on the great icosahedra intersect at many occasions so that it is harder to see they form a ring (see Fig. 13). On Infinite Kepler-Poinsot Polyhedra. 317 ...
  10. [10]
  11. [11]
    Johannes Kepler (Stanford Encyclopedia of Philosophy)
    ### Summary of Kepler's Discovery of Stellated Dodecahedra in 1619
  12. [12]
    Johannes Kepler's Polyhedra - George W. Hart
    The following illustration, from his 1619 book, Harmonice Mundi, graphically shows the Platonic associations of the regular solids with the classical elements: ...
  13. [13]
    Der barycentrische Calkul | work by Möbius - Britannica
    Möbius's mathematical papers are chiefly geometric; in many of them he developed and applied the methods laid down in his Der barycentrische Calkul (1827; “The ...
  14. [14]
    Uniform polyhedra | Philosophical Transactions of the Royal Society ...
    Coxeter H (1981) The Derivation of Schoenberg's Star-Polytopes from Schoute's Simplex Nets The Geometric Vein, 10.1007/978-1-4612-5648-9_9, (149-164), .
  15. [15]
    Kepler-Poinsot Polyhedron -- from Wolfram MathWorld
    See also. Archimedean Solid, Deltahedron, Equilateral Polyhedron, Johnson Solid, Platonic Solid, Polyhedron Compound, Star Polyhedron, Uniform Polyhedron ...
  16. [16]
    Kepler–Poinsot polyhedra - Polytope Wiki
    ### Summary of Kepler–Poinsot Polyhedra
  17. [17]
    The complete set of uniform polyhedra - Journals
    It is shown that the set of uniform polyhedra presented by Coxeter, Longuet-Higgins & Miller (1953) is essentially complete.
  18. [18]
    [PDF] Elevation Stellation - The Bridges Archive
    Stellation is a well known operation which you can apply to a polyhedron. About a century before this operation was defined by Kepler, Luca Pacioli and ...
  19. [19]
    Small Stellated Dodecahedron -- from Wolfram MathWorld
    It was rediscovered by Kepler (who used th term "urchin") in his work Harmonice Mundi in 1619, and again by Poinsot in 1809. The skeleton of the small stellated ...Missing: source | Show results with:source
  20. [20]
    the concave quasiregular - vera viana
    The video below shows how the ditrigonal dodecadodecahedron is obtained from the pentagonal dodecahedron through facetting.
  21. [21]
    Ditrigonal Dodecadodecahedron -- from Wolfram MathWorld
    It is a faceted version of the small ditrigonal icosidodecahedron. The ditrigonal dodecadodecahedron is implemented in the Wolfram Language as UniformPolyhedron ...Missing: star | Show results with:star
  22. [22]
    The fifty-nine icosahedra : Free Download, Borrow, and Streaming
    Jun 27, 2019 · The fifty-nine icosahedra. 26 p., [20] leaves of plates : 24 cm. Originally published: Toronto : University of Toronto Press, 1938.
  23. [23]
    Polyhedron models : Wenninger, Magnus J - Internet Archive
    Aug 9, 2021 · The author describes simply and carefully how to make models of all the known uniform polyhedra and some of the stellated forms.
  24. [24]
    Stella: Polyhedron navigator - ResearchGate
    Aug 7, 2025 · We introduce Stella, a computer program for navigating the world of polyhedra. The user starts by choosing from a long list of built-in ...
  25. [25]
    Stella4D Pro Manual - Software3D
    Mar 29, 2020 · Typically you start with a convex polyhedron and build stellations out from it, but the seed polyhedron does not have to be convex. Stella4D ...Missing: post- | Show results with:post-
  26. [26]
    [PDF] Exploring Noble Polyhedra With the Program Stella4D
    The family of nonconvex noble polyhedra also contains an infinite set: starting from a prism or antiprism you can construct an unlimited variety of crown ...
  27. [27]
    Defining Stellation and Facetting - Steelpillow
    Stellation is the process of selecting regions of the (n−1)-subspaces of some n-polytope such that they form a new n-polyfold. Facetting is the process of ...
  28. [28]
    Uniform Polychora and Other Four Dimensional Shapes - polytope.net
    This site describes the 6 dimensional uniform polytopes which are divided into 38 categories plus 9 prismattic categories.
  29. [29]
  30. [30]
    A Geometric Approach for Computing the Kernel of a Polyhedron
    Oct 21, 2021 · A Geometric Approach for Computing the Kernel of a Polyhedron. Authors:Tommaso Sorgente, Silvia Biasotti, Michela Spagnuolo.
  31. [31]
    [PDF] A Geometric Approach for Computing the Kernel of a Polyhedron
    At first step, we compute the Axis Aligned Bounding Box (AABB) of the polyhedron; then, we iterate on each face f of the polyhedron (black edges) and cut AABB ...
  32. [32]
    Jessen's Orthogonal Icosahedron -- from Wolfram MathWorld
    Jessen's orthogonal icosahedron is a concave shaky polyhedron constructed by replacing six pairs of adjacent triangles in an icosahedron.
  33. [33]
    miscellaneous examples of non convex polyhedra
    A polyhedron is convex if all its diagonals are inside or on its surface. A diagonal of a polyhedron is a segment joining two vertices and which is not an edge.
  34. [34]
  35. [35]
    Polyhedron kernel computation using a geometric approach
    The geometric kernel (or simply the kernel) of a polyhedron is the set of points from which the whole polyhedron is visible. Whilst the computation of the ...
  36. [36]
  37. [37]
    [PDF] On the infinitesimal rigidity of weakly convex polyhedra
    Oct 17, 2009 · Simple dented polyhedra are decomposable. Clearly, polyhedra obtained by denting a strongly strictly convex polyhedron at any set of edges have ...
  38. [38]
    Regular Polyhedral Clones - ResearchGate
    Regular Polyhedral Clones. November 2013; The Mathematical Gazette 97(540):421-429. DOI:10.1017/S0025557200000152. Authors: G. C. Shephard · G. C. Shephard.
  39. [39]
    Mr Coxeter, The densities of the regular polytopes
    In this paper it is shown how all the regular polytopes (including the Kepler-Poinsot polyhedra and Hess's analogous star polytopes in four dimensions) arise as ...
  40. [40]
    [PDF] "New" uniform polyhedra - University of Washington
    The Mathematical Scientist 19(1994), 60 – 63. [12] R. H. Jones, Enumerating uniform polyhedral surfaces with triangular faces. Discrete Math.
  41. [41]
    [PDF] Euler-Cayley Formula for 'Unusual' Polyhedra - The Bridges Archive
    Cayley generalized Euler's formula to regular star polyhedra, using the face density a, the vertex figure density b, and the polyhedron density c: bV + aF ...Missing: Arthur 1858 enumeration
  42. [42]
    [PDF] arXiv:2306.00871v1 [cond-mat.soft] 1 Jun 2023
    Jun 1, 2023 · In particular, a new theory was proposed in Ref. [11] where non-Euclidean crystals, the ordered ideal tessellation of polygons and polyhedra at ...Missing: star | Show results with:star
  43. [43]
    Great Dodecahedron -- from Wolfram MathWorld
    The great dodecahedron is the Kepler-Poinsot polyhedron whose dual is the small stellated dodecahedron. It is also uniform polyhedron.
  44. [44]
    Introducing the 3D Printed Uniform Polyhedra... - Hexagizmo
    Aug 16, 2018 · Introducing the 3D Printed Uniform Polyhedra Collection! These geometric models comprise wireframe versions of uniform 3d shapes.