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

快速四面体网格在野外

Fast Tetrahedral Meshing in the Wild

Yixin Hu, Teseo Schneider, Bolun Wang, Denis Zorin, Daniele Panozzo

摘要:

我们提出了一种新的四面体网格划分方法,fTetWild,将三角汤转换为高质量的四面体网格。我们的方法建立在TetWild算法的基础上,用一种新的增量方法来构造和优化输出网格,交错三角形插入和网格优化,取代了有理三角形插入。我们的方法可以在所有算法阶段保持有效的浮点四面体网格,无需TetWild使用有理数进行昂贵的构造,同时保持完整的鲁棒性和类似的输出质量。这使我们能够从两个方面改进TetWild。首先,我们的算法是显着更快,与运行时间相比,不太强大的基于Delaunay的四面体化算法。其次,我们的算法是保证产生一个有效的四面体网格与浮点顶点坐标,而TetWild产生一个有效的网格与合理的坐标,这是不保证有效的浮点转换后。作为权衡,我们的算法不再保证所有输入三角形都存在于输出网格中,但在实践中,正如我们在Thingi10k数据集上的测试所证实的那样,该算法总是成功插入所有输入三角形。

英文摘要:

We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rational triangle insertion with a new incremental approach to construct and optimize the output mesh, interleaving triangle insertion and mesh optimization. Our approach makes it possible to maintain a valid floating-point tetrahedral mesh at all algorithmic stages, eliminating the need for costly constructions with rational numbers used by TetWild, while maintaining full robustness and similar output quality. This allows us to improve on TetWild in two ways. First, our algorithm is significantly faster, with running time comparable to less robust Delaunay-based tetrahedralization algorithms. Second, our algorithm is guaranteed to produce a valid tetrahedral mesh with floating-point vertex coordinates, while TetWild produces a valid mesh with rational coordinates which is not guaranteed to be valid after floating-point conversion. As a trade-off, our algorithm no longer guarantees that all input triangles are present in the output mesh, but in practice, as confirmed by our tests on the Thingi10k dataset, the algorithm always succeeds in inserting all input triangles.

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

↑