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

中文翻译：

---

不断完善的展开多立方体树

我们表明，每一个多立方体树都可以用 $4\times 4$网格面的细化。这是不需要很好地分离的多维数据集树的第一个恒定细化展开结果。