Net (polyhedron)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
A net of a dodecahedron
The eleven nets of a cube

In geometry the net of a polyhedron is an arrangement of edge-joined polygons in the plane which can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.[1]

An early instance of polyhedral nets appears in the works of Albrecht Dürer, whose 1525 book Unterweysung der Messung mit dem Zyrkel und Rychtscheyd included nets for the Platonic solids and several of the Archimedean solids.[2]

Existence and uniqueness[edit]

Many different nets can exist for a given polyhedron, depending on the choices of which edges are joined and which are separated. Conversely, a given net may fold into more than one different convex polyhedron, depending on the angles at which its edges are folded and the choice of which edges to glue together.[3] If a net is given together with a pattern for gluing its edges together, such that each vertex of the resulting shape has positive angular defect and such that the sum of these defects is exactly 4π, then there necessarily exists exactly one polyhedron that can be folded from it; this is Alexandrov's uniqueness theorem. However, the polyhedron formed in this way may have different faces than the ones specified as part of the net: some of the net polygons may have folds across them, and some of the edges between net polygons may remain unfolded. Additionally, the same net may have multiple valid gluing patterns, leading to different folded polyhedra.[4]

Question dropshade.png Unsolved problem in mathematics:
Does every convex polyhedron have a net?
(more unsolved problems in mathematics)

In 1975, G. C. Shephard asked whether every convex polyhedron has at least one net.[5] This question, which is also known as Dürer's conjecture, or Dürer's unfolding problem, remains unanswered.[6][7] There exist non-convex polyhedra that do not have nets, and it is possible to subdivide the faces of every convex polyhedron (for instance along a cut locus) so that the set of subdivided faces has a net.[8] In 2014 Mohammad Ghomi showed that every convex polyhedron admits a net after an affine transformation.[9]

Shortest path[edit]

The shortest path over the surface between two points on the surface of a polyhedron corresponds to a straight line on a suitable net for the subset of faces touched by the path. The net has to be such that the straight line is fully within it, and one may have to consider several nets to see which gives the shortest path. For example, in the case of a cube, if the points are on adjacent faces one candidate for the shortest path is the path crossing the common edge; the shortest path of this kind is found using a net where the two faces are also adjacent. Other candidates for the shortest path are through the surface of a third face adjacent to both (of which there are two), and corresponding nets can be used to find the shortest path in each category.[10]

Higher-dimensional polytope nets[edit]

The geometric concept of a net can be extended to higher dimensions.

Truncated tesseract net.png
Truncated tesseract
Polychoron 24-cell net.png

For example, a net of a 4-polytope, a four-dimensional polytope, is composed of polyhedral cells that are connected by their faces and all occupy the same three-dimensional space, just as the polygon faces of a net of a polyhedron are connected by their edges and all occupy the same plane. The above net of the tesseract, the four-dimensional hypercube, is used prominently in a painting by Salvador Dalí, Crucifixion (Corpus Hypercubus) (1954).[11]

Whether or not every 4-polytope may be cut along the two-dimensional faces shared by its three-dimensional facets, and unfolded into 3D to a single nonoverlapping polyhedron (as in the above unfolding of the tesseract), remains unknown, as does the corresponding question in higher dimensions. However, it is known to be possible for every convex uniform 4-polytope.

See also[edit]


  1. ^ Wenninger, Magnus J. (1971), Polyhedron Models, Cambridge University Press 
  2. ^ A. Dürer, Unterweysung der Messung mit dem Zyrkel und Rychtscheyd. Nürnberg (1525). English translation with commentary by Walter L. Strauss The Painter's Manual, New York (1977). See pp. 139–152.
  3. ^ Malkevitch, Joseph, "Nets: A Tool for Representing Polyhedra in Two Dimensions", Feature Columns, American Mathematical Society, retrieved 2014-05-14 
  4. ^ Demaine, Erik D.; Demaine, Martin L.; Lubiw, Anna; O'Rourke, Joseph (2002), "Enumerating foldings and unfoldings between polygons and polytopes", Graphs and Combinatorics, 18 (1): 93–104, arXiv:cs.CG/0107024Freely accessible, doi:10.1007/s003730200005, MR 1892436 
  5. ^ Shephard, G. C. (1975), "Convex polytopes with convex nets", Mathematical Proceedings of the Cambridge Philosophical Society, 78 (3): 389–403, doi:10.1017/s0305004100051860, MR 0390915 
  6. ^ Weisstein, Eric W. "Shephard's Conjecture". MathWorld. 
  7. ^ dmoskovich (June 4, 2012), "Dürer's conjecture", Open Problem Garden 
  8. ^ Demaine, Erik D.; O'Rourke, Joseph (2007), "Chapter 22. Edge Unfolding of Polyhedra", Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press, pp. 306–338 
  9. ^ Ghomi, Mohammad (2014), "Affine unfoldings of convex polyhedra", Geom. Topol., 18: 3055–3090, arXiv:1305.3231Freely accessible 
  10. ^ O’Rourke, Joseph (2011), How to Fold It: The Mathematics of Linkages, Origami and Polyhedra, Cambridge University Press, pp. 115–116, ISBN 9781139498548 
  11. ^ Kemp, Martin (1 January 1998), "Dali's dimensions", Nature, 391 (6662): 27, doi:10.1038/34063 

External links[edit]