Continuous Blooming of Convex Polyhedra
Name
Demaine_Continuous blooming.pdf
Size
270.51 KB
Format
Adobe PDF
Checksum (MD5)
bae16d12b11828cda6370c086c6eb588
Author(s)
Demaine, Erik D.
Demaine, Martin L.
Hart, Vi
Iacono, John
Langerman, Stefan
O'Rourke, Joseph
Date Issued
May 2011
Journal
Graphs and Combinatorics
Publisher
Springer-Verlag
Citation
Demaine, Erik D. et al. “Continuous Blooming of Convex Polyhedra.” Graphs and Combinatorics 27 (2011): 363-376. Web. 8 Dec. 2011.
Version
Author's final manuscript
Abstract
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming.
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 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00373-011-1024-3
