Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and Anna Lubiw, “Folding and One Straight Cut Suffice”, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, January 17–19, 1999, pages 891–892.

Updates:

Ivars Peterson wrote an article describing these results, “Fold-and-Cut Magic”, Science News 162(22), November 30, 2002.

Joseph O'Rourke also wrote an article describing these results, “Computational Geometry Column 36”, International Journal of Computational Geometry and Applications, 9(6):615-618, 1999.

Length:

The paper is 2 pages and the talk is 20 minutes.

Availability:

The paper is available in PostScript (139k).

See information on file formats.

[Google Scholar search]

Related papers:

JCDCG98 (Folding and Cutting Paper)

Related webpages:

The Fold-and-Cut Problem