English

Unfolding Polycube Trees with Constant Refinement

Computational Geometry 2021-04-02 v3

Abstract

We show that every polycube tree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for polycube trees that are not required to be well-separated.

Keywords

Cite

@article{arxiv.1811.01842,
  title  = {Unfolding Polycube Trees with Constant Refinement},
  author = {Mirela Damian and Robin Flatland},
  journal= {arXiv preprint arXiv:1811.01842},
  year   = {2021}
}

Comments

42 pages, 39 figures. Preliminary results for polycube trees of degree at most 3 appeared in CCCG 2018 (polycube trees are referred to as orthotrees in the CCCG paper)

R2 v1 2026-06-23T05:04:42.114Z