Show simple item record

dc.contributor.authorDamian, Mirela
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorFlatland, Robin
dc.date.accessioned2014-04-07T17:58:47Z
dc.date.available2014-04-07T17:58:47Z
dc.date.issued2012-11
dc.date.submitted2012-10
dc.identifier.issn0911-0119
dc.identifier.issn1435-5914
dc.identifier.urihttp://hdl.handle.net/1721.1/86067
dc.description.abstractWe show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely, given an orthogonal polyhedron with n vertices, the algorithm cuts the polyhedron only where it is met by the grid of coordinate planes passing through the vertices, together with Θ(n [superscript 2]) additional coordinate planes between every two such grid planes.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CAREER Award CCF-0347776)en_US
dc.language.isoen_US
dc.publisherSpringer-Verlagen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s00373-012-1257-9en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleUnfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithmen_US
dc.typeArticleen_US
dc.identifier.citationDamian, Mirela, Erik D. Demaine, and Robin Flatland. “Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm.” Graphs and Combinatorics 30, no. 1 (January 2014): 125–140.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.mitauthorDemaine, Erik D.en_US
dc.relation.journalGraphs and Combinatoricsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsDamian, Mirela; Demaine, Erik D.; Flatland, Robinen_US
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