Show simple item record

dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.contributor.authorKonjevod, Goran
dc.contributor.authorLang, Robert J.
dc.date.accessioned2011-04-06T21:24:36Z
dc.date.available2011-04-06T21:24:36Z
dc.date.issued2009-01
dc.identifier.urihttp://hdl.handle.net/1721.1/62156
dc.description.abstractFolding an n ×n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper square of semiperimeter n 2 [superscript 2]. Indeed, within a restricted class of foldings that match all previous origami models of this flavor, one can prove a lower bound of n 2 [superscript 2](though a matching upper bound was not known). We show how to break through this barrier and fold an n ×n checkerboard from a paper square of semiperimeter 1/2 n2 [superscript 2] + O(n) In particular, our construction strictly beats semiperimeter n 2 [superscript 2] for (even) n > 16, and for n = 8, we improve on the best seamless folding.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CAREER award CCF-0347776)en_US
dc.language.isoen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-10631-6_108en_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.titleFolding a better checkerboarden_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik D, et al. "Folding a better checkerboard," ISAAC 2009 "Algorithms and computation." (Lecture notes in computer science 5878) 1074-1083. Copyright © 2009, Springeren_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.approverDemaine, Erik D.
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorDemaine, Martin L.
dc.relation.journalISAAC (Conference). Algorithms and computation (Lecture notes in computer science, v. 5878)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsDemaine, Erik D.; Demaine, Martin L.; Konjevod, Goran; Lang, Robert J.en
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record