计算广义环绕数的一次性方法
One-Shot Method for Computing Generalized Winding Numbers
AI总结:
本文提出一种仅基于曲面边界和单条射线交点计算广义环绕数的通用方法,在2D和3D中均表现出高精度和显著加速,适用于体素化和布尔运算等应用。
摘要:
广义环绕数是几何处理工具包的重要组成部分,即使曲面具有边界和噪声,它也能量化给定点在曲面内部的包含程度。我们提出了一种新的通用方法来计算广义环绕数,该方法仅基于曲面边界和单条射线与曲面的交点,支持任何支持射线相交查询的有向曲面表示。由于侧重于边界,我们的算法具有一组独特的性质。对于2D参数曲线,在规则网格查询点上,我们的方法比当前最先进的方法快4倍,同时保持相同的精度。在3D中,我们的方法可以在不对曲面进行离散化的情况下计算曲面的环绕数,包括参数曲面。对于一些具有许多三角形且边界简单的网格,我们的方法比广义环绕数的分层评估更快,同时仍然保持精确。类似地,在一些边界简单的参数曲面上,我们的方法可以比自适应求积更快。我们通过理论、数值验证,并展示了各种参数曲面和网格的结果画廊,以及在体素化和布尔运算等各种应用中的使用,来验证我们的算法。
英文摘要:
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to compute a generalized winding number, based only on the surface boundary and the intersections of a single ray with the surface, supporting any oriented surface representations that support a ray intersection query. Due to the focus on the boundary, our algorithm has a unique set of properties. For 2D parametric curves, on a regular grid of query points, our method is up to 4x faster than the current state of the art, maintaining the same precision. In 3D, our method can compute a winding number of a surface without discretizing it, including parametric surfaces. For some meshes with many triangles and a simple boundary, our method is faster than the hierarchical evaluation of the generalized winding number while still being precise. Similarly, on some parametric surfaces with a simple boundary, our method can be faster than adaptive quadrature. We validate our algorithms theoretically, numerically, and by demonstrating a gallery of results on a variety of parametric surfaces and meshes, as well uses in a variety of applications, including voxelizations and boolean operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。