A Generalization of the Source Unfolding of Convex Polyhedra

Author(s)
Demaine, Erik D.; Lubiw, Anna
Thumbnail
DownloadDemaine_A generalization.pdf (3.799Mb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We present a new method for unfolding a convex polyhedron into one piece without overlap, based on shortest paths to a convex curve on the polyhedron. Our “sun unfoldings” encompass source unfolding from a point, source unfolding from an open geodesic curve, and a variant of a recent method of Itoh, O’Rourke, and Vîlcu.
Date issued
2012
URI
http://hdl.handle.net/1721.1/86070
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Computational Geometry
Publisher
Springer-Verlag
Citation
Demaine, Erik D., and Anna Lubiw. “A Generalization of the Source Unfolding of Convex Polyhedra.” Lecture Notes in Computer Science (2012): 185–199.
Version: Author's final manuscript
ISBN
978-3-642-34190-8
978-3-642-34191-5
ISSN
0302-9743
1611-3349
Collections