Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement

Show other versions (1)

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...

Full description

Bibliographic Details
Main Authors: Damian, Mirela, Flatland, Robin, O’Rourke, Joseph, Demaine, Erik D
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer Japan 2018
Online Access:http://hdl.handle.net/1721.1/113655
https://orcid.org/0000-0003-3803-5703
Show all versions (2)

Similar Items