Ununfoldable Polyhedra with Convex Faces

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along 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 triangular faces may not be unfoldable no matter how they are cut.

• Type: Journal
• Year: 1999
• Where: CORR
• Authors: Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
• Keywords: Convex Polyhedron, CORR 1999, Education, Polyhedra, Simple Planar Polygon