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.

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement

Author(s)
Damian, Mirela; Flatland, Robin; O’Rourke, Joseph; Demaine, Erik D
Thumbnail
Download373_2017_1849_ReferencePDF.pdf (339.5Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We show that every orthogonal polyhedron of genus g≤2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the existence of at most 2 special leaves in what we call the “unfolding tree” (which ties back to the genus), so unfolding polyhedra of genus 3 and beyond requires new techniques. Keywords: Grid unfolding, Linear refinement, Orthogonal polyhedron, Genus 2
Date issued
2017-09
URI
http://hdl.handle.net/1721.1/116250
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Graphs and Combinatorics
Publisher
Springer Japan
Citation
Damian, Mirela, et al. “Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement.” Graphs and Combinatorics, vol. 33, no. 5, Sept. 2017, pp. 1357–79.
Version: Author's final manuscript
ISSN
0911-0119
1435-5914

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.