Paper by Erik D. Demaine

Reference:
Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, and Omari Stephens, “Making Polygons by Simple Folds and One Straight Cut”, in Revised Papers from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), Lecture Notes in Computer Science, Dalian, China, November 3–6, 2010, pages 27–43.

Abstract:
We give an efficient algorithmic characterization of simple polygons whose edges can be aligned onto a common line, with nothing else on that line, by a sequence of all-layers simple folds. In particular, such alignments enable the cutting out of the polygon and its complement with one complete straight cut. We also show that these makeable polygons include all convex polygons possessing a line of symmetry.

Length:
The paper is 17 pages.

Availability:
The paper is available in PostScript (4934k), gzipped PostScript (2333k), and PDF (221k).
See information on file formats.
[Google Scholar search]

Related papers:
SimpleFoldCut_CGGA2010 (Making Polygons by Simple Folds and One Straight Cut)

Related webpages:
Simple Fold & Cut Font


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated January 5, 2017 by Erik Demaine.