Show simple item record

dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.contributor.authorHawksley, Andrea
dc.contributor.authorIto, Hiro
dc.contributor.authorLoh, Po-Ru
dc.contributor.authorManber, Shelly
dc.contributor.authorStephens, Omari S.
dc.date.accessioned2012-10-10T16:08:52Z
dc.date.available2012-10-10T16:08:52Z
dc.date.issued2011-11
dc.date.submitted2010-11
dc.identifier.isbn978-3-642-24982-2
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/1721.1/73837
dc.descriptionComputational Geometry, Graphs and Applications 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papersen_US
dc.description.abstractWe 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.isoen_US
dc.publisherSpringer Berlin / Heidelbergen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-24983-9_4en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleMaking polygons by simple folds and one straight cuten_US
dc.typeArticleen_US
dc.identifier.citationDemaine, 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.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorDemaine, Martin L.
dc.contributor.mitauthorHawksley, Andrea
dc.contributor.mitauthorLoh, Po-Ru
dc.contributor.mitauthorManber, Shelly
dc.contributor.mitauthorStephens, Omari S.
dc.relation.journalComputational Geometry, Graphs and Applicationsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsDemaine, Erik D.; Demaine, Martin L.; Hawksley, Andrea; Ito, Hiro; Loh, Po-Ru; Manber, Shelly; Stephens, Omarien
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record