Ununfoldable Polyhedra with Convex Faces

Details Ununfoldable Polyhedra with Convex Faces Ununfoldable Polyhedra with Convex Faces

1999-08-03

arxiv.org/abs/cs/9908003v2

Computational Geometry: Theory and Applications 24(2):51-62, February 2003

Computer Science

Computational Geometry

14 pages, 9 figures, LaTeX 2e. To appear in Computational Geometry: Theory and Applications. Major revision with two new autho

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Ununfoldable Polyhedra with Convex Faces 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 Ununfoldable Polyhedra with Convex Faces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ununfoldable Polyhedra with Convex Faces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669221