Common net explained

In geometry, a common net is a net that can be folded onto several polyhedra. To be a valid common net, there shouldn't exist any non-overlapping sides and the resulting polyhedra must be connected through faces. The research of examples of this particular nets dates back to the end of the 20th century, despite that, not many examples have been found. Two classes, however, have been deeply explored, regular polyhedra and cuboids. The search of common nets is usually made by either extensive search or the overlapping of nets that tile the plane.

Demaine et al. proved that every convex polyhedron can be unfolded and refolded to a different convex polyhedron.[1]

There can be types of common nets, strict edge unfoldings and free unfoldings. Strict edge unfoldings refers to common nets where the different polyhedra that can be folded use the same folds, that is, to fold one polyhedra from the net of another there is no need to make new folds. Free unfoldings refer to the opposite case, when we can create as many folds as needed to enable the folding of different polyhedra.

Multiplicity of common nets refers to the number of common nets for the same set of polyhedra.

Regular polyhedra

Open problem 25.31 in Geometric Folding Algorithm by Rourke and Demaine reads:

"Can any Platonic solid be cut open and unfolded to a polygon that may be refolded to a different Platonic solid? For example, may a cube be so dissected to a tetrahedron?"[2]
This problem has been partially solved by Shirakawa et al. with a fractal net that is conjectured to fold to a tetrahedron and a cube.

MultiplicityPolyhedra 1Polyhedra 2Reference
TetrahedronCube[3]
TetrahedronCuboid (1x1x1.232)[4]
87TetrahedronJonhson Solid J17[5]
37TetrahedronJonhson Solid J84
CubeTetramonohedron[6]
Cube1x1x7 and 1x3x3 Cuboids[7]
CubeOctahedron (non-Regular)
OctahedronTetramonohedron[8]
Octahedrontetramonohedron
OctahedronTritetrahedron[9]
IcosahedronTetramonohedron

Non-regular polyhedra

Cuboids

Common nets of cuboids have been deeply researched, mainly by Uehara and coworkers. To the moment, common nets of up to three cuboids have been found, It has, however, been proven that there exist infinitely many examples of nets that can be folded into more than one polyhedra.[10]

AreaMultiplicityCuboid 1Cuboid 2Cuboid 3Reference
2264951x1x51x2x3[11]
2231x1x51x2x30x1x11[12]
281x2x4√2x√2x3√2
30301x1x71x3x3√5x√5x√5[13]
3010801x1x71x3x3
34112911x1x81x2x5
3823341x1x91x3x4
465681x1x111x3x5
46921x2x71x3x5
5417351x1x133x3x3
5418061x1x131x3x6
543871x3x63x3x3
58371x1x141x4x5
6251x3x72x3x5
64502x2x71x2x10
6462x2x72x4x4
7031x1x171x5x5
70111x2x111x3x8
882182x2x101x4x8
88862x2x102x4x6
1604x4x8√10x2√10x2√10
5327x8x142x4x432x13x16[14]
17927x8x567x14x382x13x58

Polycubes

The first cases of common nets of polycubes found was the work by George Miller, with a later contribution of Donald Knuth, that culminated in the Cubigami puzzle.[15] It’s composed of a net that can fold to all 7 tree-like tetracubes. All possible common nets up to pentacubes were found. All the nets follow strict orthogonal folding despite still being considered free unfoldings.

AreaMultiplicityPolyhedraReference
1429026 All tricubes[16]
14All tricubes
1868All tree-like tetracubes[17]
2223 pentacubes[18]
22322 tree-like pentacubes
221Non-planar pentacubes

Deltahedra

3D Simplicial polytope

AreaMultiplicityPolyhedraReference
81Both 8 face deltahedra
1047-vertex deltahedra[19]

Notes and References

  1. Demaine . Erik D. . Demaine . Martin L. . Itoh . Jin-ichi . Lubiw . Anna . Nara . Chie . OʼRourke . Joseph . 2013-10-01 . Refold rigidity of convex polyhedra . Computational Geometry . 46 . 8 . 979–989 . 10.1016/j.comgeo.2013.05.002 . 0925-7721.
  2. Book: Demaine . Erik D. . Geometric folding algorithms: linkages, origami, polyhedra . O'Rourke . Joseph . 2007 . Cambridge university press . 978-0-521-85757-4 . Cambridge.
  3. Toshihiro Shirakawa, Takashi Horiyama, and Ryuhei Uehara, 27th European Workshop on Computational Geometry (EuroCG 2011), 2011, 47-50.
  4. Koichi Hirata, Personal communication, December 2000
  5. Araki, Y., Horiyama, T., Uehara, R. (2015). Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_26
  6. Web site: Ryuuhei Uehara - Nonexistence of Common Edge Developments of Regular Tetrahedron and Other Platonic Solids - Papers - researchmap . 2024-08-01 . researchmap.jp.
  7. Xu D., Horiyama T., Shirakawa T., Uehara R., Common developments of three incongruent boxes of area 30, Computational Geometry, 64, 8 2017
  8. Book: Demaine . Erik . Geometric Folding Algorithms: Linkages, Origami, Polyhedra . O'Rourke . July 2007 . Cambridge University Press . 2007 . 978-0-521-85757-4.
  9. Web site: Weisstein . Eric . Net .
  10. Shirakawa . Toshihiro . Uehara . Ryuhei . February 2013 . Common Developments of Three Incongruent Orthogonal Boxes . International Journal of Computational Geometry & Applications . en . 23 . 1 . 65–71 . 10.1142/S0218195913500040 . 0218-1959.
  11. Mitani . Jun . Uehara . Ryuhei . 2008 . Polygons Folding to Plural Incongruent Orthogonal Boxes . Canadian Conference on Computational Geometry.
  12. Abel . Zachary . Demaine . Erik . Demaine . Martin . Matsui . Hiroaki . Rote . Günter . Uehara . Ryuhei . Common Developments of Several Different Orthogonal Boxes . The 23rd Canadian Conference on Computational Geometr . 77–82. 10119/10308 .
  13. Xu . Dawei . Horiyama . Takashi . Shirakawa . Toshihiro . Uehara . Ryuhei . August 2017 . Common developments of three incongruent boxes of area 30 . Computational Geometry . 64 . 1–12 . 10.1016/j.comgeo.2017.03.001 . 0925-7721.
  14. Shirakawa . Toshihiro . Uehara . Ryuhei . February 2013 . Common Developments of Three Incongruent Orthogonal Boxes . International Journal of Computational Geometry & Applications . en . 23 . 1 . 65–71 . 10.1142/S0218195913500040 . 0218-1959.
  15. Web site: Miller . George . Knuth . Donald . Cubigami .
  16. Web site: Mabry . Rick . Ambiguous unfoldings of polycubes .
  17. Web site: Miller . George . Cubigami .
  18. Book: Aloupis . Greg . Bose . Prosenjit K. . Collette . Sébastien . Demaine . Erik D. . Demaine . Martin L. . Douïeb . Karim . Dujmović . Vida . Iacono . John . Langerman . Stefan . Morin . Pat . Common Unfoldings of Polyominoes and Polycubes . Lecture Notes in Computer Science . 2011 . 7033 . Akiyama . Jin . Bo . Jiang . Kano . Mikio . Tan . Xuehou . Computational Geometry, Graphs and Applications . https://link.springer.com/chapter/10.1007/978-3-642-24983-9_5 . en . Berlin, Heidelberg . Springer . 44–54 . 10.1007/978-3-642-24983-9_5 . 978-3-642-24983-9.
  19. Web site: Mabry . Rick . The four common nets of the five 7-vertex deltahedra .