arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.01326cs.CG
收藏

展开具有正交凸层的多立方体

Unfolding Polycubes with Orthogonally Convex Layers

Mirela Damian, Henk Meijer

AI总结:

本文提出一种边缘展开算法,能将具有正交凸层的多立方体展平为单一不重叠的平面片,且切割仅沿立方体边缘进行。

摘要:

多立方体是由单位立方体沿整个面粘合而成的正交多面体,且与球同胚。多立方体的一层是指位于相距一个单位的两个水平横截面之间的部分。我们提出了一种展开算法,能将任何具有正交凸层的多立方体展平为单一且不重叠的平面片。该算法仅沿立方体边缘进行切割,即这是一种边缘展开。

英文摘要:

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We present an unfolding algorithm that flattens any polycube with orthogonally convex layers into a single, non-overlapping planar piece. The algorithm makes cuts only along cube edges-that is, it is an edge unfolding.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑