Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement by Damian, Mirela, Flatland, Robin, O’Rourke, Joseph, Demaine, Erik D

“…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.…”
Get full text
Get full text

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement by Damian, Mirela, Flatland, Robin, O’Rourke, Joseph, Demaine, Erik D

“…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. …”
Get full text
Get full text

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm by Damian, Mirela, Demaine, Erik D., Flatland, Robin

Get full text
Get full text