Ensiklopedia Dunia

From Wikipedia, the free encyclopedia

In computational geometry, the source unfolding of a convex polyhedron is a net obtained by cutting the polyhedron along the cut locus of a point on the surface of the polyhedron. The cut locus of a point $p$ consists of all points on the surface that have two or more shortest geodesics to $p$ . For every convex polyhedron, and every choice of the point $p$ on its surface, cutting the polyhedron on the cut locus will produce a result that can be unfolded into a flat plane, producing the source unfolding. The resulting net may, however, cut across some of the faces of the polyhedron rather than only cutting along its edges.^[1]

The source unfolding can also be continuously transformed from the polyhedron to its flat net, keeping flat the parts of the net that do not lie along edges of the polyhedron, as a blooming of the polyhedron.^[2] The unfolded shape of the source unfolding is always a star-shaped polygon, with all of its points visible by straight line segments from the image of $p$ ; this is in contrast to the star unfolding, a different method for producing nets that does not always produce star-shaped polygons.^[1]

An analogous unfolding method can be applied to any higher-dimensional convex polytope, cutting the surface of the polytope into a net that can be unfolded into a flat hyperplane.^[3]

References

^ ^a ^b Demaine, Erik; O'Rourke, Joseph (2007), "24.1.1 Source unfolding", Geometric Folding Algorithms, Cambridge University Press, pp. 359–362, ISBN 978-0-521-71522-5
^ Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph (2011), "Continuous blooming of convex polyhedra", Graphs and Combinatorics, 27 (3): 363–376, CiteSeerX 10.1.1.150.9715, doi:10.1007/s00373-011-1024-3, MR 2787423, S2CID 82408. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.
^ Miller, Ezra; Pak, Igor (2008), "Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings", Discrete & Computational Geometry, 39 (1–3): 339–388, doi:10.1007/s00454-008-9052-3, MR 2383765. Announced in 2003.

v t e Mathematics of paper folding
Flat folding	Big-little-big lemma Crease pattern Huzita–Hatori axioms Kawasaki's theorem Maekawa's theorem Map folding Napkin folding problem Pureland origami Yoshizawa–Randlett system
Strip folding	Dragon curve Flexagon Möbius strip Regular paperfolding sequence
3d structures	Miura fold Modular origami Paper bag problem Rigid origami Schwarz lantern Sonobe Yoshimura buckling
Polyhedra	Alexandrov's uniqueness theorem Flexible polyhedron (Bricard octahedron, Steffen's polyhedron) Net Blooming Common net Source unfolding Star unfolding
Miscellaneous	Fold-and-cut theorem Lill's method
Publications	Geometric Exercises in Paper Folding Geometric Folding Algorithms Geometric Origami A History of Folding in Mathematics Origami Polyhedra Design Origamics
People	Roger C. Alperin Margherita Piazzola Beloch Yan Chen Robert Connelly Erik Demaine Martin Demaine Rona Gurkewitz David A. Huffman Tom Hull Kôdi Husimi Humiaki Huzita Toshikazu Kawasaki Robert J. Lang Anna Lubiw Jun Maekawa Kōryō Miura Joseph O'Rourke Tomohiro Tachi Eve Torrence

Categories: