Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement
Name
373_2017_1849_ReferencePDF.pdf
Size
339.56 KB
Format
Adobe PDF
Checksum (MD5)
8fa890c7a3e611e70fc1756cbf578aa5
Author(s)
Damian, Mirela
Flatland, Robin
O’Rourke, Joseph
Demaine, Erik D
Date Issued
September 2017
Journal
Graphs and Combinatorics
Publisher
Springer Japan
Citation
Damian, Mirela, Erik Demaine, Robin Flatland, and Joseph O’Rourke. “Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement.” Graphs and Combinatorics 33, no. 5 (September 2017): 1357–1379.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00373-017-1849-5
