dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Demaine, Martin L. | |
dc.contributor.author | Hawksley, Andrea | |
dc.contributor.author | Ito, Hiro | |
dc.contributor.author | Loh, Po-Ru | |
dc.contributor.author | Manber, Shelly | |
dc.contributor.author | Stephens, Omari S. | |
dc.date.accessioned | 2012-10-10T16:08:52Z | |
dc.date.available | 2012-10-10T16:08:52Z | |
dc.date.issued | 2011-11 | |
dc.date.submitted | 2010-11 | |
dc.identifier.isbn | 978-3-642-24982-2 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/73837 | |
dc.description | Computational Geometry, Graphs and Applications 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers | en_US |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer Berlin / Heidelberg | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-24983-9_4 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Making polygons by simple folds and one straight cut | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.contributor.mitauthor | Demaine, Erik D. | |
dc.contributor.mitauthor | Demaine, Martin L. | |
dc.contributor.mitauthor | Hawksley, Andrea | |
dc.contributor.mitauthor | Loh, Po-Ru | |
dc.contributor.mitauthor | Manber, Shelly | |
dc.contributor.mitauthor | Stephens, Omari S. | |
dc.relation.journal | Computational Geometry, Graphs and Applications | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Demaine, Erik D.; Demaine, Martin L.; Hawksley, Andrea; Ito, Hiro; Loh, Po-Ru; Manber, Shelly; Stephens, Omari | en |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |