Unfolding genus-2 orthogonal polyhedra with linear refinement

DOI10.1007/s00373-017-1849-5zbMath1412.52012arXiv1611.00106OpenAlexW2547304849MaRDI QIDQ1684951

Mirela Damian, Joseph O'Rourke, Robin Y. Flatland, Erik D. Demaine

Publication date: 12 December 2017

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

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

zbMATH Keywords

linear refinementgenus 2grid unfoldingorthogonal polyhedron

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Elementary problems in Euclidean geometries (51M04) Polyhedral manifolds (52B70)

Related Items (8)

Toward unfolding doubly covered \(n\)-stars ⋮ Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra ⋮ Unnamed Item ⋮ Unfolding polycube trees with constant refinement ⋮ Unfolding Level 1 Menger Polycubes of Arbitrary Size With Help of Outer Faces ⋮ Unfolding H-convex Manhattan towers ⋮ Unfolding \(3\)-separated polycube graphs of arbitrary genus ⋮ Unfolding some classes of orthogonal polyhedra of arbitrary genus

Cites Work

• Unnamed Item
• Ununfoldable polyhedra with convex faces
• Epsilon-unfolding orthogonal polyhedra
• Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm
• Unfolding Manhattan towers
• On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes
• Unfolding Orthogonal Polyhedra with Linear Refinement

This page was built for publication: Unfolding genus-2 orthogonal polyhedra with linear refinement