Continuous Blooming of Convex Polyhedra
Author(s)
Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph; ... Show more Show less
DownloadDemaine_Continuous blooming.pdf (270.5Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2011-05Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISSN
1435-5914
0911-0119