Unfolding Polycube Trees with Constant Refinement

Autor:	Damian, Mirela, Flatland, Robin
Rok vydání:	2018
Předmět:	Computer Science - Computational Geometry F.2.2
Druh dokumentu:	Working Paper
Popis:	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. Comment: 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)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1811.01842 Zobrazit plný text záznamu View this record from Arxiv