Publication View

Continuous Blooming of Convex Polyhedra (2009)

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.. Comment: 13 pages, 6 figures

Publication details
Download http://arxiv.org/abs/0906.2461
Repository arXiv (United States)
Keywords Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms, I.3.5, F.2.2
Type text