Unfolding polycube trees with constant refinement

DOI10.1016/j.comgeo.2021.101793OpenAlexW3161917708MaRDI QIDQ2230418

Mirela Damian, Robin Y. Flatland

Publication date: 17 September 2021

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

unfoldingorthogonal polyhedraconstant refinementorthotreepolycube tree

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Computing methodologies and applications (68Uxx) Polytopes and polyhedra (52Bxx)

Related Items (2)

Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unfolding genus-2 orthogonal polyhedra with linear refinement
• 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
• Unfolding some classes of orthogonal polyhedra of arbitrary genus

This page was built for publication: Unfolding polycube trees with constant refinement