Computer Science – Computational Geometry
Scientific paper
2009-06-13
Computer Science
Computational Geometry
13 pages, 6 figures
Scientific paper
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.
Demaine Erik D.
Demaine Martin L.
Hart Vi
Iacono John
Langerman Stefan
No associations
LandOfFree
Continuous Blooming of Convex Polyhedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Continuous Blooming of Convex Polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuous Blooming of Convex Polyhedra will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-252296