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

一种用于曲面的快速几何多重网格方法

A Fast Geometric Multigrid Method for Curved Surfaces

Ruben Wiersma, Ahmad Nasikun, Elmar Eisemann, Klaus Hildebrandt

AI总结:

本文提出 Gravo MG,一种基于点云简化层级表示的几何多重网格方法,通过图 Voronoi 图构建均衡切向连接的稀疏延拓算子,实现曲面变分问题线性系统的快速求解,并适用于点云、非流形网格和多边形网格。

摘要:

我们提出了一种几何多重网格方法 Gravo MG,用于求解几何处理中曲面上变分问题所产生的线性系统。我们的方案使用点云作为多重网格层级的一种简化表示,以实现快速的层级构建,并将该方法的适用范围从三角形网格扩展到其他曲面表示形式,如点云、非流形网格和多边形网格。为了构建延拓算子,我们将层级中的每个点关联到由下一较粗层级中的点所构成的一个三角形。我们通过计算以粗点为中心的图 Voronoi 图并确定相邻的 Voronoi 单元,来获得形状良好的候选三角形。我们对三角形的选择确保了每个点与相邻较粗层级和较细层级中的点在切向方向上的连接是均衡的。因此,我们得到了每行只有三个非零项的稀疏延拓矩阵,并且求解器具有快速收敛性。

英文摘要:

We introduce a geometric multigrid method for solving linear systems arising from variational problems on surfaces in geometry processing, Gravo MG. Our scheme uses point clouds as a reduced representation of the levels of the multigrid hierarchy to achieve a fast hierarchy construction and to extend the applicability of the method from triangle meshes to other surface representations like point clouds, nonmanifold meshes, and polygonal meshes. To build the prolongation operators, we associate each point of the hierarchy to a triangle constructed from points in the next coarser level. We obtain well-shaped candidate triangles by computing graph Voronoi diagrams centered around the coarse points and determining neighboring Voronoi cells. Our selection of triangles ensures that the connections of each point to points at adjacent coarser and finer levels are balanced in the tangential directions. As a result, we obtain sparse prolongation matrices with three entries per row and fast convergence of the solver.

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

↑