Ununfoldable Polyhedra with Convex Faces

Simple item page
dc.creatorBern, Marshall
dc.creatorDemaine, Erik D.
dc.creatorEppstein, David
dc.creatorKuo, Eric
dc.creatorMantler, Andrea
dc.creatorSnoeyink, Jack
dc.date1999-08-03
dc.date2001-08-27
dc.date.accessioned2026-07-07T03:24:17Z
dc.date.available2026-07-07T03:24:17Z
dc.descriptionUnfolding 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.
dc.description14 pages, 9 figures, LaTeX 2e. To appear in Computational Geometry: Theory and Applications. Major revision with two new authors, solving the open problem about triangular faces
dc.identifierhttps://arxiv.org/abs/cs/9908003
dc.identifierhttp://arxiv.org/abs/cs/9908003
dc.identifierComputational Geometry: Theory and Applications 24(2):51-62, February 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33267
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.subjectG.2.1; F.2.2
dc.titleUnunfoldable Polyhedra with Convex Faces
dc.typetext

Files

Collections

arXiv