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
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Graphs and Combinatorics
Demaine, Erik D. et al. “Continuous Blooming of Convex Polyhedra.” Graphs and Combinatorics 27 (2011): 363-376. Web. 8 Dec. 2011.
Author's final manuscript