MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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
Thumbnail
DownloadDemaine-Making Polygons.pdf (112.6Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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
Date issued
2011-11
URI
http://hdl.handle.net/1721.1/73837
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
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
ISBN
978-3-642-24982-2
ISSN
0302-9743
1611-3349

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.