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

ITS:面向多边形网格的隐式薄壳

ITS: Implicit Thin Shell for Polygonal Meshes

Huibiao Wen, Lei Wang, Yunxiao Zhang, Shuangmin Chen, Shiqing Xin, Chongyang Deng, Ying He, Wenping Wang, Changhe Tu

AI总结:

该研究提出隐式薄壳ITS概念,采用一次三元张量积B样条结合自适应节点网格近似网格SDF,通过穷举候选点求极值得到最小厚度薄壳,可严密包裹网格,适用于快速内外测试和误差可控的网格简化。

摘要:

在计算机图形学中,将多边形网格表面$\u212c$简化为与$\u212c$高度贴合的几何代理至关重要,这能显著降低各类应用的计算开销。本文提出隐式薄壳(Implicit Thin Shell,ITS)概念,用于隐式表示$\u212c$周围的夹壁空间,其定义为$\{\textbf{x}\u2208\uc2a4^3|\u03b5_1\u2264 f(\textbf{x}) \u2264 \u03b5_2, \u03b5_1< 0, \u03b5_2>0\}$。其中$f$是$\u212c$的有符号距离函数(SDF)的近似,我们的目标是最小化厚度$\u03b5_2-\u03b5_1$。为在$f$的数学简洁性与表达能力间取得平衡,我们采用三元张量积B样条表示$f$。该表示结合了可适配$\u212c$固有形状变化的自适应节点网格,同时将$f$的基函数限制为一次。通过这种方式,求解稀疏线性系统即可快速确定$f$的解析形式。此外,在$\u212c$上无穷多点中寻找$f$极值的过程可简化为在有限候选点集中寻找极值。通过穷举候选点,我们找到使厚度最小的极值$\u03b5_1<0$和$\u03b5_2>0$。构建的ITS可保证严密包裹$\u212c$,边界面与$\u212c$之间无任何相交。凭借其严密性、紧致性、表达性和计算效率,ITS具备众多潜在应用。我们通过快速内外测试和通过全局误差控制的网格简化,验证了ITS的有效性。

英文摘要:

In computer graphics, simplifying a polygonal mesh surface~$\mathcal{M}$ into a geometric proxy that maintains close conformity to~$\mathcal{M}$ is crucial, as it can significantly reduce computational demands in various applications. In this paper, we introduce the Implicit Thin Shell~(ITS), a concept designed to implicitly represent the sandwich-walled space surrounding~$\mathcal{M}$, defined as~$\{\textbf{x}\in\mathbb{R}^3|ε_1\leq f(\textbf{x}) \leq ε_2, ε_1< 0, ε_2>0\}$. Here, $f$ is an approximation of the signed distance function~(SDF) of~$\mathcal{M}$, and we aim to minimize the thickness~$ε_2-ε_1$. To achieve a balance between mathematical simplicity and expressive capability in~$f$, we employ a tri-variate tensor-product B-spline to represent~$f$. This representation is coupled with adaptive knot grids that adapt to the inherent shape variations of~$\mathcal{M}$, while restricting~$f$'s basis functions to the first degree. In this manner, the analytical form of~$f$ can be rapidly determined by solving a sparse linear system. Moreover, the process of identifying the extreme values of~$f$ among the infinitely many points on~$\mathcal{M}$ can be simplified to seeking extremes among a finite set of candidate points. By exhausting the candidate points, we find the extreme values~$ε_1<0$ and $ε_2>0$ that minimize the thickness. The constructed ITS is guaranteed to wrap~$\mathcal{M}$ rigorously, without any intersections between the bounding surfaces and~$\mathcal{M}$. ITS offers numerous potential applications thanks to its rigorousness, tightness, expressiveness, and computational efficiency. We demonstrate the efficacy of ITS in rapid inside-outside tests and in mesh simplification through the control of global error.

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

↑