Making polygons by simple folds and one straight cut
Name
Demaine-Making Polygons.pdf
Size
112.66 KB
Format
Adobe PDF
Checksum (MD5)
c25917fc17ea6ba4a6d1622bc2db9201
Author(s)
Demaine, Erik D.
Demaine, Martin L.
Hawksley, Andrea
Ito, Hiro
Loh, Po-Ru
Manber, Shelly
Stephens, Omari S.
Date Issued
November 2011
Journal
Computational Geometry, Graphs and Applications
Publisher
Springer Berlin / Heidelberg
Citation
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.
Version
Author's final manuscript
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.
Description
Computational Geometry, Graphs and Applications 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers
MIT Department
Massachusetts 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
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-24983-9_4
