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

面向展开的网格简化(Mesh Simplification For Unfolding)

Mesh Simplification For Unfolding

Manas Bhargava, Camille Schreck, Marco Freire, Pierre-Alexandre Hugron, Sylvain Lefebvre, Silvia Sellán, Bernd Bickel

AI总结:

针对三维形状无重叠单面片等距展开难题,提出几何松弛方案,通过展开引导的顶点位移与边折叠修改输入形状以实现无重叠展开,在复杂形状数据集上验证有效且可用于纸艺制作。

摘要:

我们提出一种计算方法,可将三维形状等距展开为平面上的单个无重叠三角面片。这是一个困难甚至有时无解的问题,现有方法不得不放宽约束,允许映射失真或使用多个面片。与之不同,我们提出该问题的几何松弛方案:修改输入形状,直至其能实现无重叠展开。我们通过在展开过程引导下局部移动顶点、折叠边来实现这一点。我们在包含复杂形状的大型数据集上对算法进行了定量和定性验证,并通过用纸制作真实形状展示了其有效性。

英文摘要:

We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: we modify the input shape until it admits an overlap-free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper.

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

↑