# Polyhedron

"Polyhedra" redirects here. For the relational database system, see Polyhedra DBMS.
For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). For the occlusion bodies in Baculovirus infection, see Polyhedrin.

In geometry, a polyhedron (plural polyhedra or polyhedrons) is a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices. The word polyhedron comes from the Classical Greek πολύεδρον, as poly- (stem of πολύς, "many") + -hedron (form of ἕδρα, "base" or "seat").

A convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra.

A polyhedron is a 3-dimensional example of the more general polytope in any number of dimensions.

## Definition

A skeletal polyhedron (specifically, a rhombicuboctahedron) drawn by Leonardo da Vinci to illustrate a book by Luca Pacioli

Although convex polyhedra are well-defined, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of "polyhedron" have been given within particular contexts,[1] some more rigorous than others, and there is not universal agreement over which of these to choose. Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include shapes that are often not considered as valid polyhedra (such as solids whose boundaries are not manifolds). As Branko Grünbaum observed, "The Original Sin in the theory of polyhedra goes back to Euclid, and through Kepler, Poinsot, Cauchy and many others ... [in that] at each stage ... the writers failed to define what are the 'polyhedra' ...."[2] Nevertheless, there is general agreement that a polyhedron is a solid or surface that can be described by its vertices (corner points), edges (line segments connecting certain pairs of vertices), faces (two-dimensional polygons), and sometimes by its three-dimensional interior volume. One can distinguish among these different definitions according to whether they describe the polyhedron as a solid, whether they describe it as a surface, or whether they describe it more abstractly based on its incidence geometry.

• A common and somewhat naive definition of a polyhedron is that it is a solid whose boundary can be covered by finitely many planes[3][4] or that it is a solid formed as the union of finitely many convex polyhedra.[5] Natural refinements of this definition require the solid to be bounded, to have a connected interior, and possibly also to have a connected boundary. The faces of such a polyhedron can be defined as the connected components of the parts of the boundary within each of the planes that cover it, and the edges and vertices as the line segments and points where the two faces meet. However, the polyhedra defined in this way do not include the self-crossing star polyhedra, their faces may not form simple polygons, and some edges may belong to more than two faces.[6]
• Definitions based on the idea of a bounding surface rather than a solid are also common.[7] For instance, O'Rourke (1993) defines a polyhedron as a union of convex polygons (its faces), arranged in space so that the intersection of any two polygons is a shared vertex or edge or the empty set and so that their union is a manifold.[8] If a planar part of such a surface is not itself a convex polygon, O'Rourke requires it to be subdivided into smaller convex polygons, with flat dihedral angles between them. Again, this definition does not encompass the self-crossing polyhedra. Similar notions form the basis of topological definitions of polyhedra, as subdivisions of a topological manifold into topological disks (the faces) whose pairwise intersections are required to be points (vertices), topological arcs (edges), or the empty set.
• One modern approach is based on the theory of abstract polyhedra. These can be defined as partially ordered sets whose elements are the vertices, edges, and faces of a polyhedron. A vertex or edge element is less than an edge or face element (in this partial order) when the vertex or edge is part of the edge or face. Additionally, one may include a special bottom element of this partial order (representing the empty set) and a top element representing the whole polyhedron. If the sections of the partial order between each face and the bottom element, and between the top element and each vertex, are required to describe polygons, these carry exactly the same information as a topological polyhedron. However, these requirements are often relaxed, to instead require only that the sections between elements two levels apart form line segments.[9] (This means that each edge contains two vertices and belongs to two faces, and that each vertex on a face belongs to two edges of that face.) Geometric polyhedra, defined in other ways, can be described abstractly in this way, but it is also possible to use abstract polyhedra as the basis of a definition of geometric polyhedra. A realization of an abstract polyhedron is generally taken to be a mapping from the vertices of the abstract polyhedron to geometric points, such that the points of each face are coplanar. A geometric polyhedron can then be defined as a realization of an abstract polyhedron.[10] Realizations that forgo the requirement of planarity, that impose additional requirements of symmetry, or that map the vertices to higher dimensional spaces have also been considered.[9] Unlike the solid-based and surface-based definitions, this works perfectly well for star polyhedra. However, without additional restrictions, this definition allows degenerate or unfaithful polyhedra (for instance, by mapping all vertices to a single point) and the question of how to constrain realizations to avoid these degeneracies has not been settled.

In all of these definitions, a polyhedron is typically understood as a three-dimensional example of the more general polytope in any number of dimensions. For example, a polygon has a two-dimensional body and no faces, while a 4-polytope has a four-dimensional body and an additional set of three-dimensional "cells". However, some of the literature on higher-dimensional geometry uses the term "polyhedron" to mean something else: not a three-dimensional polytope, but a shape that is different from a polytope in some way. For instance, some sources define a convex polyhedron to be the intersection of finitely many half-spaces, and a polytope to be a bounded polyhedron.[11][12] The remainder of this article considers only three-dimensional polyhedra.

## Characteristics

### Polyhedral surface

A defining characteristic of many kinds of polyhedra is that just two faces join along any common edge. Likewise any edge meets just two vertices, one at each end. These two characteristics are dual to each other and they ensure that the polyhedral surface is continuously connected and does not end abruptly or split off in different directions.

For similar reasons, the surface may not be divisible into two parts such that each part is a valid polyhedron. This rules out both self-intersecting compound polyhedra or figures joined only by a vertex or an edge, such as two tetrahedra joined at a common apex.

Every simple (non-self-intersecting) polyhedron has at least two faces with the same number of edges.[13]

### Number of faces

Polyhedra may be classified and are often named according to the number of faces. The naming system is based on Classical Greek, for example tetrahedron (4), pentahedron (5), hexahedron (6), triacontahedron (30), and so on.

For a complete list of the Greek numeral prefixes see Numeral prefixes>Table of number prefixes in English>Greek>Quantitative

### Topological characteristics

The topological class of a polyhedron is defined by its Euler characteristic and orientability.

From this perspective, any polyhedral surface may be classed as certain kind of topological manifold. For example, the surface of a convex or indeed any simply connected polyhedron is a topological sphere.

#### Euler characteristic

The Euler characteristic χ relates the number of vertices V, edges E, and faces F of a polyhedron:

${\displaystyle \chi =V-E+F.\ }$

This is equal to the topological Euler characteristic of its surface. For a convex polyhedron, or more generally any simply connected polyhedron (with surface a topological sphere), χ = 2.[14]

For more complicated shapes, the Euler characteristic relates to the number of toroidal holes, handles or cross-caps in the surface and will be less than 2.[15]

#### Orientability

Self-intersecting Klein bottle approximated as quadrilateral polyhedron

Some polyhedra have two distinct sides to their surface, for example the inside and outside of a convex polyhedron paper model can each be given a different colour (although the inside colour will be hidden from view). We say that the figure is orientable. Some non-convex orientable polyhedra have regions turned "inside out" so that both colours appear on the outside in different places.

But for some polyhedra, such as the tetrahemihexahedron, this is not possible and the surface is said to be one-sided. Such a polyhedron is non-orientable.

All polyhedra with odd-numbered Euler characteristic χ are non-orientable. A given figure with even χ < 2 may or may not be orientable. For example, the one-holed toroid and the Klein bottle both have χ = 0, with the first being orientable and the other not.

### Duality

Main article: Dual polyhedron
The octahedron is dual to the cube

For every convex polyhedron, there exists a dual polyhedron having

• faces in place of the original's vertices and vice versa, and
• the same number of edges.

The dual of a convex polyhedron can be obtained by the process of polar reciprocation. Dual polyhedra exist in pairs, and the dual of a dual is just the original polyhedron again. Some polyhedra are self-dual, meaning that the dual of the polyhedron is congruent to the original polyhedron.[16]

Abstract polyhedra also have duals, which satisfy in addition that they have the same Euler characteristic and orientability as the initial polyhedron. However, this form of duality does not describe the shape of a dual polyhedron, but only its combinatorial structure. For some definitions of non-convex geometric polyhedra, there exist polyhedra whose abstract duals cannot be realized as geometric polyhedra under the same definition.

### Vertex figures

Main article: Vertex figure

For every vertex one can define a vertex figure, which describes the local structure of the polyhedron around the vertex. Precise definitions vary, but a vertex figure can be thought of as the polygon exposed where a slice through the polyhedron cuts off a corner.[7] If the vertex figure is a regular polygon, then the vertex itself is said to be regular.

### Volume

Regular polyhedra

Any regular polyhedron can be divided up into congruent pyramids, with each pyramid having a face of the polyhedron as its base and the centre of the polyhedron as its apex. The height of a pyramid is equal to the inradius of the polyhedron. If the area of a face is ${\displaystyle A}$ and the in-radius is ${\displaystyle r}$ then the volume of the pyramid is one-third of the base times the height, or ${\displaystyle Ar/3}$. For a regular polyhedron with ${\displaystyle n}$ faces, its volume is then simply

${\displaystyle {\text{volume}}=nAr/3}$.

For instance, a cube with edges of length ${\displaystyle L}$ has six faces, each face being a square with area ${\displaystyle A=L^{2}}$. The inradius from the center of the face to the center of the cube is ${\displaystyle r=L/2}$. Then the volume is given by

${\displaystyle {\text{volume}}={\frac {6\cdot L^{2}\cdot {\frac {L}{2}}}{3}}=L^{3},}$

the usual formula for the volume of a cube.

Orientable polyhedra

The volume of any orientable polyhedron can be calculated using the divergence theorem. Consider the vector field ${\displaystyle {\vec {F}}({\vec {x}})={\frac {1}{3}}{\vec {x}}=\left({\frac {x_{1}}{3}},{\frac {x_{2}}{3}},{\frac {x_{3}}{3}}\right)}$, whose divergence is identically 1. The divergence theorem implies that the volume is equal to a surface integral of ${\displaystyle F(x)}$:

${\displaystyle {\text{volume}}(\Omega )=\int _{\Omega }\nabla \cdot {\vec {F}}d\Omega =\oint _{S}{\vec {F}}\cdot {\hat {n}}dS.}$

When Ω is the region enclosed by a polyhedron, since the faces of a polyhedron are planar and have piecewise constant normal vectors, this simplifies to

${\displaystyle {\text{volume}}={\frac {1}{3}}\sum _{{\text{face }}i}{\vec {x}}_{i}\cdot {\hat {n}}_{i}A_{i}}$

where ${\displaystyle {\vec {x}}_{i}}$ is the ith face's barycenter, ${\displaystyle {\hat {n}}_{i}}$ is its normal vector, and ${\displaystyle A_{i}}$ is its area.[17] Once the faces are decomposed in a set of non-overlapping triangles with surface normals pointing away from the volume, the volume is one sixth of the sum over the triple products of the nine Cartesian vertex coordinates of the triangles.

Since it may be difficult to enumerate the faces, volume computation may be challenging, and hence there exist specialized algorithms to determine the volume (many of these generalize to convex polytopes in higher dimensions).[18]

## Convex polyhedra

Convex polyhedron blocks on display at the Universum museum in Mexico City

A three-dimensional solid is a convex set if it contains every line segment connecting two of its points. A convex polyhedron is a polyhedron that, as a solid, forms a convex set. A convex polyhedron can also be defined as a bounded intersection of finitely many half-spaces, or as the convex hull of finitely many points.

Important classes of convex polyhedra include the highly symmetrical Platonic solids, the Archimedean solids and their duals the Catalan solids, and the regular-faced Johnson solids.

## Symmetries

Many of the most studied polyhedra are highly symmetrical, that is, their appearance is unchanged by some reflection or rotation of space. Each such symmetry may change the location of a given vertex, face, or edge, but the set of all vertices (likewise faces, edges) is unchanged. The collection of symmetries of a polyhedron is called its symmetry group.

All the elements that can be superimposed on each other by symmetries are said to form a "symmetry orbit". For example, all the faces of a cube lie in one orbit, while all the edges lie in another. If all the elements of a given dimension, say all the faces, lie in the same orbit, the figure is said to be "transitive" on that orbit. For example, a cube is face-transitive, while a truncated cube has two symmetry orbits of faces.

The same abstract structure may support more or less symmetric geometric polyhedra. But where a polyhedral name is given, such as icosidodecahedron, the most symmetrical geometry is almost always implied, unless otherwise stated.[citation needed]

There are several types of highly symmetric polyhedron, classified by which kind of element - faces, edges, or vertices - belong to a single symmetry orbit:

• Regular: vertex-transitive, edge-transitive and face-transitive. (This implies that every face is the same regular polygon; it also implies that every vertex is regular.)
• Quasi-regular: vertex-transitive and edge-transitive (and hence has regular faces) but not face-transitive. A quasi-regular dual' is face-transitive and edge-transitive (and hence every vertex is regular) but not vertex-transitive.
• Semi-regular: vertex-transitive but not edge-transitive, and every face is a regular polygon. (This is one of several definitions of the term, depending on author. Some definitions overlap with the quasi-regular class.) These polyhedra include the semiregular prisms and antiprisms. A semi-regular dual is face-transitive but not vertex-transitive, and every vertex is regular.
• Uniform: vertex-transitive and every face is a regular polygon, i.e., it is regular, quasi-regular or semi-regular. A uniform dual is face-transitive and has regular vertices, but is not necessarily vertex-transitive.
• Isogonal: vertex-transitive.
• Isotoxal: edge-transitive.
• Isohedral: face-transitive.
• Noble: face-transitive and vertex-transitive (but not necessarily edge-transitive). The regular polyhedra are also noble; they are the only noble uniform polyhedra.

Some classes of polyhedra have only a single main axis of symmetry. These include the pyramids, bipyramids, trapezohedra, cupolae, as well as the semiregular prisms and antiprisms.

### Regular polyhedra

Regular polyhedra are the most highly symmetrical. Altogether there are nine regular polyhedra: five convex and four star polyhedra.

The five convex examples have been known since antiquity and are called the Platonic solids. These are the triangular pyramid or tetrahedron, cube, octahedron, dodecahedron and icosahedron:

There are also four regular star polyhedra, known as the Kepler–Poinsot polyhedra after their discoverers.

The dual of a regular polyhedron is also regular.

### Uniform polyhedra and their duals

Main article: Uniform polyhedron

Uniform polyhedra are vertex-transitive and every face is a regular polygon. They may be subdivided into the regular, quasi-regular, or semi-regular, and may be convex or starry.

The uniform duals have irregular faces but are face-transitive and every vertex figure is a regular polygon. A uniform polyhedron has the same symmetry orbits as its dual, with the faces and vertices simply swapped over. The duals of the convex Archimedean polyhedra are sometimes called the Catalan solids.

The uniform polyhedra and their duals are traditionally classified according to their degree of symmetry, and whether they are convex or not.

Convex uniform Convex uniform dual Star uniform Star uniform dual
Regular Platonic solids Kepler–Poinsot polyhedra
Quasiregular Archimedean solids Catalan solids (no special name) (no special name)
Semiregular (no special name) (no special name)
Prisms Bipyramids Star prisms Star Bipyramids
Antiprisms Trapezohedra Star antiprisms Star trapezohedra

### Pyramids

Main article: Pyramid (geometry)

Symmetrical pyramids include some of the most time-honoured and famous of all polyhedra, such as the four-sided Egyptian pyramids.

### Noble polyhedra

Main article: Noble polyhedron

A noble polyhedron is both isohedral (equal-faced) and isogonal (equal-cornered), but not necessarily equal-sided. Besides the regular polyhedra, there are many other examples.

The dual of a noble polyhedron is also noble.

### Isohedra

Main article: Isohedron

An isohedron is a polyhedron with symmetries acting transitively on its faces. Their topology can be represented by a face configuration. All 5 Platonic solids and 13 Catalan solids are isohedra, as well as the infinite families of trapezohedra and bipyramids. Some isohedra allow geometric variations including concave and self-intersecting forms.

### Symmetry groups

Full Icosahedral symmetry divides the sphere into 120 triangular domains.

Many of the symmetries or point groups in three dimensions are named after polyhedra having the associated symmetry. These include:

Those with chiral symmetry do not have reflection symmetry and hence have two enantiomorphous forms which are reflections of each other. Examples include the snub cuboctahedron and snub icosidodecahedron.

## Polyhedra with regular faces

Besides the regular and uniform polyhedra, there are some other classes which have regular faces but lower overall symmetry.

### Equal regular faces

Convex polyhedra where every face is the same kind of regular polygon may be found among three families:

• Triangles: These polyhedra are called deltahedra. There are eight convex deltahedra, comprising three of the regular (Platonic) polyhedra and five non-uniform examples.
• Squares: The cube is the only convex example. Others can be obtained by joining cubes together, although care must be taken if coplanar faces are to be avoided.
• Pentagons: The regular dodecahedron is the only convex example.

Polyhedra with congruent regular faces of six or more sides are all non-convex, because the vertex of three regular hexagons defines a plane.

The total number of convex polyhedra with equal regular faces is thus ten, comprising the five Platonic solids and the five non-uniform deltahedra.[19]

There are infinitely many non-convex examples. Infinite sponge-like examples called infinite skew polyhedra exist in some of these families.

### Johnson solids

Main article: Johnson solid

Norman Johnson sought which convex non-uniform polyhedra had regular faces, although not necessarily all alike. In 1966, he published a list of 92 such solids, gave them names and numbers, and conjectured that there were no others. Victor Zalgaller proved in 1969 that the list of these Johnson solids was complete.

## Other important families of polyhedra

### Stellations and facettings

Main article: Stellation

Stellation of a polyhedron is the process of extending the faces (within their planes) so that they meet to form a new polyhedron.

It is the exact reciprocal to the process of facetting which is the process of removing parts of a polyhedron without creating any new vertices.

### Zonohedra

Main article: Zonohedron

A zonohedron is a convex polyhedron where every face is a polygon with inversion symmetry or, equivalently, symmetry under rotations through 180°. They can be constructed as the Minkowski sums of line segments, and include several important space-filling polyhedra.[20]

### Toroidal polyhedra

Main article: Toroidal polyhedron

A toroidal polyhedron is a polyhedron with an Euler characteristic of 0 or smaller, equivalent to a genus of 1 or greater, representing a torus surface having one or more holes through the middle.

### Spacefilling polyhedra

Main article: Honeycomb (geometry)

A spacefilling polyhedron packs with copies of itself to fill space. Such a close-packing or spacefilling is often called a tessellation of space or a honeycomb. Some honeycombs involve more than one kind of polyhedron.

### Compounds

Main article: Polyhedral compound

A polyhedral compound is made of two or more polyhedra sharing a common centre.

Symmetrical compounds often share the same vertices as other well-known polyhedra and may often also be formed by stellation. Some are listed in the list of Wenninger polyhedron models.

### Orthogonal polyhedra

An orthogonal polyhedron is one all of whose faces meet at right angles, and all of whose edges are parallel to axes of a Cartesian coordinate system. Aside from a rectangular box, orthogonal polyhedra are nonconvex. They are the 3D analogs of 2D orthogonal polygons, also known as rectilinear polygons. Orthogonal polyhedra are used in computational geometry, where their constrained structure has enabled advances on problems unsolved for arbitrary polyhedra, for example, unfolding the surface of a polyhedron to a polygonal net.[21]

## Generalisations of polyhedra

The name 'polyhedron' has come to be used for a variety of objects having similar structural properties to traditional polyhedra.

### Apeirohedra

A classical polyhedral surface has a finite number of faces, joined in pairs along edges. If the number of faces extends indefinitely it is called an apeirohedron. Examples include:

### Complex polyhedra

Main article: Complex polytope

A complex polyhedron is one which is constructed in complex Hilbert 3-space. This space has six dimensions: three real ones corresponding to ordinary space, with each accompanied by an imaginary dimension. A complex polyhedron is mathematically more closely related to configurations than to real polyhedra.[22]

### Curved polyhedra

Some fields of study allow polyhedra to have curved faces and edges.

#### Spherical polyhedra

Main article: Spherical polyhedron

The surface of a sphere may be divided by line segments into bounded regions, to form a spherical polyhedron. Much of the theory of symmetrical polyhedra can be derived in this way.

Some polyhedra, such as hosohedra, exist only as spherical polyhedra and have no flat-faced analogue.[23]

#### Curved spacefilling polyhedra

If faces are allowed to be concave as well as convex, adjacent faces may be made to meet together with no gap. Some of these curved polyhedra can pack together to fill space. Two important types are:

### Hollow-faced or skeletal polyhedra

It is not necessary to fill in the face of a figure before we can call it a polyhedron. For example, Leonardo da Vinci devised frame models of the regular solids, which he drew for Pacioli's book Divina Proportione. Similar wire-frame polyhedra also appear in M. C. Escher's print Stars.[26]

Branko Grünbaum (1994) made a special study of this class of polyhedra, in which he developed an early idea of abstract polyhedra. He defined a face as a cyclically ordered set of vertices, and allowed faces to be skew as well as planar.[27]

## Alternative usages

From the latter half of the twentieth century, various mathematical constructs have been found to have properties also present in traditional polyhedra. Rather than confining the term "polyhedron" to describe a three-dimensional polytope, it has been adopted to describe various related but distinct kinds of structure.

### Higher-dimensional polyhedra

A polyhedron has been defined as a set of points in real affine (or Euclidean) space of any dimension n that has flat sides. It may alternatively be defined as the intersection of finitely many half-spaces. Unlike a conventional polyhedron, it may be bounded or unbounded. In this meaning, a polytope is a bounded polyhedron.[11][12]

Analytically, such a convex polyhedron is expressed as the solution set for a system of linear inequalities. Defining polyhedra in this way provides a geometric perspective for problems in linear programming. Many traditional polyhedral forms are polyhedra in this sense. Other examples include:

• A quadrant in the plane. For instance, the region of the cartesian plane consisting of all points above the horizontal axis and to the right of the vertical axis: { ( x, y ) : x ≥ 0, y ≥ 0 }. Its sides are the two positive axes, and it is otherwise unbounded.
• An octant in Euclidean 3-space, { ( x, y, z ) : x ≥ 0, y ≥ 0, z ≥ 0 }.
• A prism of infinite extent. For instance a doubly infinite square prism in 3-space, consisting of a square in the xy-plane swept along the z-axis: { ( x, y, z ) : 0 ≤ x ≤ 1, 0 ≤ y ≤ 1 }.
• Each cell in a Voronoi tessellation is a convex polyhedron. In the Voronoi tessellation of a set S, the cell A corresponding to a point cS is bounded (hence a traditional polyhedron) when c lies in the interior of the convex hull of S, and otherwise (when c lies on the boundary of the convex hull of S) A is unbounded.

### Topological polyhedra

A topological polytope is a topological space given along with a specific decomposition into shapes that are topologically equivalent to convex polytopes and that are attached to each other in a regular way.

Such a figure is called simplicial if each of its regions is a simplex, i.e. in an n-dimensional space each region has n+1 vertices. The dual of a simplicial polytope is called simple. Similarly, a widely studied class of polytopes (polyhedra) is that of cubical polyhedra, when the basic building block is an n-dimensional cube.

### Abstract polyhedra

Main article: Abstract polytope

An abstract polytope is a partially ordered set (poset) of elements whose partial ordering obeys certain rules of incidence (connectivity) and ranking. The elements of the set correspond to the vertices, edges, faces and so on of the polytope: vertices have rank 0, edges rank 1, etc. with the partially ordered ranking corresponding to the dimensionality of the geometric elements. The empty set, required by set theory, has a rank of −1 and is sometimes said to correspond to the null polytope. An abstract polyhedron is an abstract polytope having the following ranking:

• rank 3: The maximal element, sometimes identified with the body.
• rank 2: The polygonal faces.
• rank 1: The edges.
• rank 0: the vertices.
• rank −1: The empty set, sometimes identified with the null polytope.

Any geometric polyhedron is then said to be a "realization" in real space of the abstract poset as described above.

### Polyhedra as graphs

Any polyhedron gives rise to a graph, or skeleton, with corresponding vertices and edges. Thus graph terminology and properties can be applied to polyhedra. For example:

## History

### Prehistory

Polyhedra appeared in early architectural forms such as cubes and cuboids, with the earliest four-sided pyramids of ancient Egypt also dating from the Stone Age.

The Etruscans preceded the Greeks in their awareness of at least some of the regular polyhedra, as evidenced by the discovery near Padua (in Northern Italy) in the late 19th century of a dodecahedron made of soapstone, and dating back more than 2,500 years (Lindemann, 1987).

### Greek civilisation

The earliest known written records of these shapes come from Classical Greek authors, who also gave the first known mathematical description of them. The earlier Greeks were interested primarily in the convex regular polyhedra, which came to be known as the Platonic solids. Pythagoras knew at least three of them, and Theaetetus (circa 417 B. C.) described all five. Eventually, Euclid described their construction in his Elements. Later, Archimedes expanded his study to the convex uniform polyhedra which now bear his name. His original work is lost and his solids come down to us through Pappus.

### China

Cubical gaming dice in China have been dated back as early as 600 B.C.[citation needed]

By 236 AD, Liu Hui was describing the dissection of the cube into its characteristic tetrahedron (orthoscheme) and related solids, using assemblages of these solids as the basis for calculating volumes of earth to be moved during engineering excavations.

### Islamic civilisation

After the end of the Classical era, scholars in the Islamic civilisation continued to take the Greek knowledge forward (see Mathematics in medieval Islam).

The 9th century scholar Thabit ibn Qurra gave formulae for calculating the volumes of polyhedra such as truncated pyramids.

Then in the 10th century Abu'l Wafa described the convex regular and quasiregular spherical polyhedra.

### Renaissance

As with other areas of Greek thought maintained and enhanced by Islamic scholars, Western interest in polyhedra revived during the Italian Renaissance. Artists constructed skeletal polyhedra, depicting them from life as a part of their investigations into perspective. Several appear in marquetry panels of the period. Piero della Francesca gave the first written description of direct geometrical construction of such perspective views of polyhedra. Leonardo da Vinci made skeletal models of several polyhedra and drew illustrations of them for a book by Pacioli. A painting by an anonymous artist of Pacioli and a pupil depicts a glass rhombicuboctahedron half-filled with water.

As the Renaissance spread beyond Italy, later artists such as Wenzel Jamnitzer, Dürer and others also depicted polyhedra of various kinds, many of them novel, in imaginative etchings.

### Star polyhedra

For almost 2,000 years, the concept of a polyhedron as a convex solid had remained as developed by the ancient Greek mathematicians.

During the Renaissance star forms were discovered. A marble tarsia in the floor of St. Mark's Basilica, Venice, depicts a stellated dodecahedron. Artists such as Wenzel Jamnitzer delighted in depicting novel star-like forms of increasing complexity.

Johannes Kepler (1571 - 1630) used star polygons, typically pentagrams, to build star polyhedra. Some of these figures may have been discovered before Kepler's time, but he was the first to recognize that they could be considered "regular" if one removed the restriction that regular polytopes must be convex. Later, Louis Poinsot realised that star vertex figures (circuits around each corner) can also be used, and discovered the remaining two regular star polyhedra. Cauchy proved Poinsot's list complete, and Cayley gave them their accepted English names: (Kepler's) the small stellated dodecahedron and great stellated dodecahedron, and (Poinsot's) the great icosahedron and great dodecahedron. Collectively they are called the Kepler-Poinsot polyhedra.

The Kepler-Poinsot polyhedra may be constructed from the Platonic solids by a process called stellation. Most stellations are not regular. The study of stellations of the Platonic solids was given a big push by H. S. M. Coxeter and others in 1938, with the now famous paper The 59 icosahedra.[28]

The reciprocal process to stellation is called facetting (or faceting). Every stellation of one polytope is dual, or reciprocal, to some facetting of the dual polytope. The regular star polyhedra can also be obtained by facetting the Platonic solids. Bridge (1974) listed the simpler facettings of the dodecahedron, and reciprocated them to discover a stellation of the icosahedron that was missing from the set of "59".[29] More have been discovered since, and the story is not yet ended.[citation needed]

### Euler's formula and topology

Two other modern mathematical developments had a profound effect on polyhedron theory.

In 1750 the German Leonhard Euler for the first time considered the edges of a polyhedron, allowing him to discover his polyhedron formula relating the number of vertices, edges and faces. This signalled the birth of topology, sometimes referred to as "rubber sheet geometry", and the Frenchman Henri Poincaré developed its core ideas around the end of the nineteenth century. This allowed many longstanding issues over what was or was not a polyhedron to be resolved.

Max Brückner summarised work on polyhedra to date, including many findings of his own, in his book "Vielecke und Vielflache: Theorie und Geschichte" (Polygons and polyhedra: Theory and History). Published in German in 1900, it remained little known.

Meanwhile, the discovery of higher dimensions led to the idea of a polyhedron as a three-dimensional example of the more general polytope.

### The twentieth century revival

By the early years of the twentieth century, mathematicians had moved on and geometry was little studied. Coxeter's analysis in The Fifty-Nine Icosahedra introduced modern ideas from graph theory and combinatorics into the study of polyhedra, signalling a rebirth of interest in geometry.

Coxeter himself went on to enumerate the star uniform polyhedra for the first time, to treat tilings of the plane as polyhedra, to discover the regular skew polyhedra and to develop the theory of complex polyhedra first discovered by Shephard in 1952, as well as making fundamental contributions to many other areas of geometry.

In the second part of the twentieth century, Grünbaum published important works in two areas. One was in convex polytopes, where he noted a tendency among mathematicians to define a "polyhedron" in different and sometimes incompatible ways to suit the needs of the moment. The other was a series of papers broadening the accepted definition of a polyhedron, for example discovering many new Regular polyhedra. At the close of the 20th century these latter ideas merged with other work on incidence complexes to create the modern idea of an abstract polyhedron (as an abstract 3-polytope), notably presented by McMullen and Schulte.

## Polyhedra in nature

For natural occurrences of regular polyhedra, see Regular polyhedron: Regular polyhedra in nature.

Irregular polyhedra appear in nature as crystals.

## References

Notes

1. ^ Lakatos, Imre (2015) [1976], Proofs and Refutations: The logic of mathematical discovery, Cambridge Philosophy Classics, Cambridge: Cambridge University Press, p. 16, doi:10.1017/CBO9781316286425, ISBN 978-1-107-53405-6, MR 3469698, definitions are frequently proposed and argued about.
2. ^ Grünbaum (1994), p. 43.
3. ^ McCormack, Joseph P. (1931), Solid Geometry, D. Appleton-Century Company, p. 416.
4. ^ de Berg, M.; van Kreveld, M.; Overmars, M.; Schwarzkopf, O. (2000), Computational Geometry: Algorithms and Applications (2nd ed.), Springer, p. 64.
5. ^ Matveev, S. V. (2001), "Polyhedron, abstract", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
6. ^ Stewart, B. M. (1980), Adventures Among the Toroids: A study of orientable polyhedra with regular faces (2nd ed.), p. 6.
7. ^ a b Cromwell (1997), pp. 206–209.
8. ^ O'Rourke, Joseph (1993), Computational Geometry in C, Cambridge University Press, pp. 113–116.
9. ^ a b Burgiel, H.; Stanton, D. (2000), "Realizations of regular abstract polyhedra of types {3,6} and {6,3}", Discrete and Computational Geometry, 24 (2-3): 241–255, doi:10.1007/s004540010030, MR 1758047.
10. ^ Grünbaum (2003), pp. 468–469.
11. ^ a b Grünbaum, Branko (2003), Convex Polytopes, Graduate Texts in Mathematics, 221 (2nd ed.), New York: Springer-Verlag, p. 26, doi:10.1007/978-1-4613-0019-9, ISBN 0-387-00424-6, MR 1976856.
12. ^ a b Bruns, Winfried; Gubeladze, Joseph (2009), "Definition 1.1", Polytopes, Rings, and K-theory, Springer Monographs in Mathematics, Dordrecht: Springer, p. 5, doi:10.1007/b105283, ISBN 978-0-387-76355-2, MR 2508056.
13. ^ Inequalities proposed in Crux Mathematicorum :224, #105 from International Mathematical Olympiad Compendium
14. ^ Richeson (2008), p. 157.
15. ^ Richeson (2008), p. 180.
16. ^ Grünbaum, B.; Shephard, G. C. (1969), "Convex polytopes" (PDF), Bulletin of the London Mathematical Society, 1: 257–300, doi:10.1112/blms/1.3.257 (inactive February 21, 2017), MR 0250188. See in particular the bottom of page 260.
17. ^ Arvo, James (1991). Graphic Gems Package: Graphics Gems II. Academic Press.
18. ^ Büeler, B.; Enge, A.; Fukuda, K. (2000). "Exact Volume Computation for Polytopes: A Practical Study". Polytopes — Combinatorics and Computation. p. 131. doi:10.1007/978-3-0348-8438-9_6. ISBN 978-3-7643-6351-2.
19. ^ Cundy, H. Martyn; Rollett, A. P. (1961), Mathematical models (2nd ed.), Oxford: Clarendon Press, MR 0124167.[page needed].
20. ^ Taylor, Jean E. (1992), "Zonohedra and generalized zonohedra", American Mathematical Monthly, 99 (2): 108–111, doi:10.2307/2324178, MR 1144350.
21. ^ O'Rourke, Joseph (2008), "Unfolding orthogonal polyhedra", Surveys on discrete and computational geometry, Contemp. Math., 453, Amer. Math. Soc., Providence, RI, pp. 307–317, doi:10.1090/conm/453/08805, MR 2405687.
22. ^ Coxeter, H. S. M. (1974), Regular Complex Polytopes, Cambridge: Cambridge University Press, MR 0370328.[page needed]
23. ^ Popko, Edward S. (2012), Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere, CRC Press, p. 463, ISBN 9781466504301, A hosohedron is only possible on a sphere.
24. ^ Kraynik, A. M.; Reinelt, D. A. (2007), "Foams, Microrheology of", in Mortensen, Andreas, Concise Encyclopedia of Composite Materials (2nd ed.), Elsevier, pp. 402–407. See in particular p. 403: "foams consist of polyhedral gas bubbles ... each face on a polyhedron is a minimal surface with uniform mean curvature ... no face can be a flat polygon with straight edges".
25. ^ Pearce, P.; Structure in nature is a strategy for design, MIT (1978)
26. ^ Coxeter, H. S. M. (1985), "A special book review: M. C. Escher: His life and complete graphic work", The Mathematical Intelligencer, 7 (1): 59–69, doi:10.1007/BF03023010 Coxeter's analysis of Stars is on pp. 61–62.
27. ^ Grünbaum (1994)
28. ^ Coxeter, H. S. M.; Du Val, P.; Flather, H. T.; Petrie, J. F. (1999) [1938], The Fifty-Nine Icosahedra, Tarquin Publications, ISBN 1-899618-32-5, MR 676126.
29. ^ Bridge, N. J. (1974), "Faceting the dodecahedron", Acta Crystallographica Section A, 30 (4): 548–552, doi:10.1107/s0567739474001306.

Sources