Continuous Blooming of Convex Polyhedra
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.
Bibliographic Details
Main Authors: |
Demaine, Erik D.
(Contributor),
Demaine, Martin L.
(Contributor),
Hart, Vi
(Author),
Iacono, John
(Author),
Langerman, Stefan
(Author),
O'Rourke, Joseph
(Author) |
Other Authors: |
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
(Contributor),
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
(Contributor) |
Format: | Article
|
Language: | English |
Published: |
Springer-Verlag,
2011-12-08T17:56:00Z.
|
Subjects: | |
Online Access: | Get fulltext
|