Paper by Erik D. Demaine

Reference:

Erik D. Demaine, “Folding and Unfolding Linkages, Paper, and Polyhedra”, in Revised Papers from the Japan Conference on Discrete and Computational Geometry (JCDCG 2000), Lecture Notes in Computer Science, volume 2098, Tokyo, Japan, November 22–25, 2000, pages 113–124.

Abstract:

Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500's [Dü77], but have not been studied extensively until recently. Over the past few years, there has been a surge of interest in these problems in discrete and computational geometry. This paper gives a brief survey of some of the recent work in this area, subdivided into three sections based on the type of object being folded: linkages, paper, or polyhedra. See also [O'R98] for a related survey from this conference two years ago.

Comments:

This paper is also available from the electronic LNCS volume as http://link.springer.de/link/service/series/0558/papers/2098/20980113.pdf.

Copyright:

The paper is \copyright Springer-Verlag.

Length:

The paper is 12 pages.

Availability:

The paper is available in PostScript (743k), gzipped PostScript (178k), and PDF (169k).

See information on file formats.

[Google Scholar search]