arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.13356math.NAcs.CGcs.NA
收藏

高阶多尺度网格生成的快速边界积分法

A fast boundary integral method for high-order multiscale mesh generation

Felipe Vico, Leslie Greengard, Michael O'Neil, Manas Rachh

摘要:

在这项工作中,我们提出了一个算法来构建一个无限可微的光滑表面从输入组成的(直线)三角形的任意形状的表面。原始曲面可以具有非平凡亏格和多尺度特征,算法的计算复杂性与输入三角形的个数成线性关系。我们使用一个平滑核来定义一个函数$Φ$,其水平集定义了感兴趣的表面。图表随后生成为从原始用户指定的三角形到$\mathbb R^3$的映射。平滑度由内核局部控制,以与输入三角剖分的精细度相称。~ $Φ$的表达式可以转化为边界积分,其计算可以使用快速多极方法来加速。我们证明了该算法的有效性和成本与多面体和二次骨架曲面从CAD和网格软件。

英文摘要:

In this work we present an algorithm to construct an infinitely differentiable smooth surface from an input consisting of a (rectilinear) triangulation of a surface of arbitrary shape. The original surface can have non-trivial genus and multiscale features, and our algorithm has computational complexity which is linear in the number of input triangles. We use a smoothing kernel to define a function $Φ$ whose level set defines the surface of interest. Charts are subsequently generated as maps from the original user-specified triangles to $\mathbb R^3$. The degree of smoothness is controlled locally by the kernel to be commensurate with the fineness of the input triangulation. The expression for~$Φ$ can be transformed into a boundary integral, whose evaluation can be accelerated using a fast multipole method. We demonstrate the effectiveness and cost of the algorithm with polyhedral and quadratic skeleton surfaces obtained from CAD and meshing software.

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

↑