Ununfoldable Polyhedra (1999) [15 citations — 7 self]
Download:
http://daisy.uwaterloo.ca/~eddemain/papers/CCCG99b
http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp
DBLP
CACHED:
|
http://daisy.uwaterloo.ca/~eddemain/papers/CCCG99b
http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp
DBLP
CACHED:
by
Marshall Bern
,
Erik D. Demaine
,
David Eppstein
,
Eric Kuo
Add To MetaCart
Abstract:
A well-studied problem is that of unfolding a convex polyhedron into a simple planar polygon. In this paper, we study the limits of unfoldability. We give an example of a polyhedron with convex faces that cannot be unfolded by cutting along its edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed to cross faces. Finally, we prove that "open" polyhedra with convex faces may not be unfoldable no matter how they are cut.

