Unfolding \(3\)-separated polycube graphs of arbitrary genus

DOI10.1016/j.comgeo.2022.101944zbMath1505.52012OpenAlexW4295736082WikidataQ114195399 ScholiaQ114195399MaRDI QIDQ2096388

Robin Y. Flatland, Mirela Damian

Publication date: 16 November 2022

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101944

zbMATH Keywords

unfoldingorthogonal polyhedraedge unfoldingarbitrary genusconstant refinement

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55)

Cites Work

• 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
• 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
• Unnamed Item

This page was built for publication: Unfolding \(3\)-separated polycube graphs of arbitrary genus