Content deleted Content added
ToadetteEdit (talk | contribs) m ToadetteEdit moved page Draft:Common net to Common net: Publishing accepted Articles for creation submission (AFCH) |
m Open access bot: hdl updated in citation with #oabot. |
||
| (6 intermediate revisions by 6 users not shown) | |||
Line 1:
{{Short description|Edge-joined polygon with multiple principle shapes}}
[[File:TritetrahedronAmbiguousNet_1000.svg|thumb|400x400px|Common net for both a [[octahedron]] and a Tritetrahedron.]]▼
In [[geometry]], a '''common net''' is a [[Net (polyhedron)|net]]
▲[[File:TritetrahedronAmbiguousNet_1000.svg|thumb|400x400px|Common net for both a octahedron and a Tritetrahedron.]]
▲In [[geometry]], a common [[Net (polyhedron)|net]] refers to nets that can be folded onto several [[Polyhedron|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 XX 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.<ref>{{Cite journal |last1=Demaine |first1=Erik D. |last2=Demaine |first2=Martin L. |last3=Itoh |first3=Jin-ichi |last4=Lubiw |first4=Anna |last5=Nara |first5=Chie |last6=OʼRourke |first6=Joseph |date=2013-10-01 |title=Refold rigidity of convex polyhedra |url=https://www.sciencedirect.com/science/article/pii/S0925772113000400 |journal=Computational Geometry |volume=46 |issue=8 |pages=979–989 |doi=10.1016/j.comgeo.2013.05.002 |issn=0925-7721|hdl=1721.1/99989 |hdl-access=free }}</ref>
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.
Line 13 ⟶ 9:
Multiplicity of common nets refers to the number of common nets for the same set of polyhedra.
== Regular
Open problem 25.31 in [[Geometric Folding Algorithms|Geometric Folding Algorithm by Rourke and Demaine]] reads:<blockquote>''"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?"''<ref>{{Cite book |last1=Demaine |first1=Erik D. |title=Geometric folding algorithms: linkages, origami, polyhedra |last2=O'Rourke |first2=Joseph |date=2007 |publisher=Cambridge university press |isbn=978-0-521-85757-4 |location=Cambridge}}</ref></blockquote>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.
{| class="wikitable"
Line 29 ⟶ 25:
|Tetrahedron
|Cuboid (1x1x1.232)
|<ref>Koichi Hirata, Personal communication, December 2000</ref>
|-
|87
Line 44 ⟶ 40:
|Cube
|Tetramonohedron
|<ref name=":3">
|-
|
Line 77 ⟶ 73:
|}
== Non-regular
=== Cuboids ===
[[File:Cuboid_common_net.png|thumb|395x395px|Common net of a 1x1x5 and 1x2x3 cuboid]]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.<ref>{{Cite journal |last1=Shirakawa |first1=Toshihiro |last2=Uehara |first2=Ryuhei |date=February 2013 |title=Common Developments of Three Incongruent Orthogonal Boxes |url=https://www.worldscientific.com/doi/abs/10.1142/S0218195913500040 |journal=International Journal of Computational Geometry & Applications |language=en |volume=23 |issue=1 |pages=65–71 |doi=10.1142/S0218195913500040 |issn=0218-1959}}</ref>
{| class="wikitable"
!Area
Line 253 ⟶ 249:
=== 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.<ref name=":4">{{Cite web |last1=Miller |first1=George |last2=Knuth |first2=Donald |title=Cubigami |url=http://www.puzzlepalace.com/#/collections/9}}</ref>
{| class="wikitable"
!Area
Line 309 ⟶ 305:
|<ref>{{Cite web |last=Mabry |first=Rick |title=The four common nets of the five 7-vertex deltahedra |url=https://lsusmath.rickmabry.org/rmabry/dodec/delta/common.html}}</ref>
|}
== References ==
{{reflist}}
{{Mathematics of paper folding}}
[[Category:Polyhedra]]
| |||