Document Type
Article
Publication Date
5-2011
Publication Title
Graphs and Combinatorics
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.
Keywords
Unfolding, Folding, Collision-free motion
Volume
27
Issue
3
First Page
363
Last Page
376
DOI
dx.doi.org/doi:10.1007/s00373-011-1024-3
ISSN
1435-5914
Recommended Citation
Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, Joan; Langerman, Stefan; and O'Rourke, Joseph, "Continuous Blooming of Convex Polyhedra" (2011). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/31
COinS
Comments
Author’s submitted manuscript. Language included at the request of the publisher: The final publication is available at Springer via http://dx.doi.org/10.1007/s00373-011-1024-3