arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.16865cs.CGcs.GR
收藏

通过对偶环构建多立方体

Polycubes via Dual Loops

Maxim Snoep, Bettina Speckmann, Kevin Verbeek

AI总结:

提出利用沿坐标轴方向的有向对偶环及其相交模式完整刻画任意亏格多立方体,并给出环的增删规则,从而实现为输入曲面构造可证明有效多立方体映射的迭代算法。

摘要:

本文研究多立方体(polycubes):具有轴对齐四边形面的正交多面体。我们基于其对偶结构,提出了对任意亏格多立方体的完整刻画:该结构是一组沿各坐标轴方向延伸的有向环,并通过环之间的相交模式来刻画多立方体。一个多立方体环结构唯一对应于一个多立方体。我们还描述了在保持环结构有效性的前提下,向其中添加一个环的所有组合上不同的方式。类似地,我们展示了如何识别可从多立方体环结构中移除而不会使其失效的环。我们的刻画产生了一种迭代算法,能够为给定输入曲面构造可证明有效的多立方体映射。

英文摘要:

In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each of the axis directions and capture polycubes via their intersection patterns. A polycube loop structure uniquely corresponds to a polycube. We also describe all combinatorially different ways to add a loop to a loop structure while maintaining its validity. Similarly, we show how to identify loops that can be removed from a polycube loop structure without invalidating it. Our characterization gives rise to an iterative algorithm to construct provably valid polycube maps for a given input surface.

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

↑