Making polygons by simple folds and one straight cut
Author(s)Demaine, Erik D.; Demaine, Martin L.; Hawksley, Andrea; Ito, Hiro; Loh, Po-Ru; Manber, Shelly; Stephens, Omari S.; ... Show more Show less
MetadataShow full item record
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.
Computational Geometry, Graphs and Applications 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Computational Geometry, Graphs and Applications
Springer Berlin / Heidelberg
Demaine, Erik D. et al. “Making Polygons by Simple Folds and One Straight Cut.” Computational Geometry, Graphs and Applications. Ed. Jin Akiyama et al. LNCS Vol. 7033. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 27–43.
Author's final manuscript