Paper by Erik D. Demaine

Reference:

Zachary Abel, Erik D. Demaine, and Martin L. Demaine, “A Topologically Convex Vertex-Ununfoldable Polyhedron”, in Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Ontario, Canada, August 10–12, 2011, to appear.

Abstract:

We construct a polyhedron that is topologically convex (i.e., has the graph of a convex polyhedron) yet has no vertex unfolding: no matter how we cut along the edges and keep faces attached at vertices to form a connected (hinged) surface, the surface necessarily unfolds with overlap.

Availability:

The paper is available in PDF (245k).

See information on file formats.

[Google Scholar search]