Continuous Blooming of Convex Polyhedra
Computational Geometry
2009-06-16 v1 Data Structures and Algorithms
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
Cite
@article{arxiv.0906.2461,
title = {Continuous Blooming of Convex Polyhedra},
author = {Erik D. Demaine and Martin L. Demaine and Vi Hart and John Iacono and Stefan Langerman and Joseph O'Rourke},
journal= {arXiv preprint arXiv:0906.2461},
year = {2009}
}
Comments
13 pages, 6 figures