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.
Main Authors: | Demaine, Erik D., Demaine, Martin L., Hart, Vi, Iacono, John, Langerman, Stefan, O'Rourke, Joseph |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2011
|
Online Access: | http://hdl.handle.net/1721.1/67481 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
Refold rigidity of convex polyhedra
by: Demaine, Erik D., et al.
Published: (2015) -
Continuously Flattening Polyhedra Using Straight Skeletons
by: Demaine, Erik D., et al.
Published: (2015) -
Geometric folding algorithms : linkages, origami, polyhedra /
by: Demaine, Erik D., 1981-, et al.
Published: (2007) -
A Generalization of the Source Unfolding of Convex Polyhedra
by: Demaine, Erik D., et al.
Published: (2014) -
Finding closed quasigeodesics on convex polyhedra
by: Demaine, Erik D, et al.
Published: (2021)