Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm

DOI10.1007/s00373-012-1257-9zbMath1287.52012arXiv1112.4791OpenAlexW2223424801MaRDI QIDQ2441357

Robin Y. Flatland, Erik D. Demaine, Mirela Damian

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.4791

zbMATH Keywords

grid refinementorthogonal polyhedragrid unfoldinggeneral unfoldinggenus-zero

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polytopes and polyhedra (52B99)

Related Items (7)

Unfolding genus-2 orthogonal polyhedra with linear refinement ⋮ Toward unfolding doubly covered \(n\)-stars ⋮ Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra ⋮ Unnamed Item ⋮ Unfolding polycube trees with constant refinement ⋮ Unfolding \(3\)-separated polycube graphs of arbitrary genus ⋮ Unfolding some classes of orthogonal polyhedra of arbitrary genus

Cites Work

• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• Ununfoldable polyhedra with convex faces
• Epsilon-unfolding orthogonal polyhedra
• Unfolding Manhattan towers
• Common Unfoldings of Polyominoes and Polycubes

This page was built for publication: Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm