A Generalization of the Source Unfolding of Convex Polyhedra
Name
Demaine_A generalization.pdf
Size
3.8 MB
Format
Adobe PDF
Checksum (MD5)
3fafa0d86750d6a5af1c8bdf6499483f
Author(s)
Demaine, Erik D.
Lubiw, Anna
Date Issued
2012
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-34191-5_18
