From: orourke@cs.smith.edu (Joseph O'Rourke)
Subject: Re: Unwrapping 3D Polygonal Surface
To: rusin@math.niu.edu (Dave Rusin)
Date: Mon, 19 Feb 1996 16:23:57 -0500 (EST)

> In article <4fgf06$emo@sylvia.smith.edu> you write:
> >1. It is a long-standing unsolved problem to determine whether or
> >not every convex polytope (polyhedron) can be unfolded by cutting
> >along edges and laid flat in the plane in one piece without overlap.
> 
> Can you give a reference or summarize what's known and what's not
> (mathematically speaking)

Summarizing is easy: nothing is known.  It is quite easy to find
a non-overlapping unfolding in any given case, but to prove that
there is always such an unfolding for every convex polytope, that
is the hard nut.  I can't provide any references, sorry.  Besides,
there is almost nothing to reference!
					:-j