Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
复制标题
用于非结构化网格生成的快速质心 Voronoi Delaunay 三角剖分
DOI：
10.1016/j.cam.2014.11.035
复制
发表时间：
2015-05-15
影响因子：
2.4
通讯作者：
Tan, Z. J.
中科院分区：
文献类型：
--
作者：
Wang, B.;Khoo, B. C.;Tan, Z. J.
本文提出了一种基于一致质心 Voronoi Delaunay 三角剖分（CfCVDT）算法（Ju，2007）的快速非结构化网格生成算法。在新算法中，约束Delaunay三角剖分（CDT）算法仅用于初始网格的生成。通过多次迭代更新顶点位置和翻转边来不断提高网格质量。由于CfCVDT算法中最耗时的过程是每次迭代中的CDT，新算法成功地避免了CDT，因此效率得到了显着提高。此外，该算法生成的网格具有与 CfCVDT 生成的网格类似的高质量特征。当涉及复杂的界面时，我们的算法可以非常有效地保持网格符合界面。通过使用各种密度函数，该算法可以为许多潜在的应用生成高质量的非均匀网格。 (C) 2014 Elsevier B.V. 保留所有权利。
A fast unstructured mesh generation algorithm based on conforming centroidal Voronoi Delaunay triangulation (CfCVDT) algorithm (Ju, 2007) is proposed in this paper. In the new algorithm, the constrained Delaunay triangulation (CDT) algorithm is used only for the generation of the initial mesh. The mesh quality shall be continuously improved by updating the positions of vertices and flipping edges in a number of iterations. Since the most time consuming procedure in CfCVDT algorithm is the CDT in each iteration which has been successfully avoided in this new algorithm the efficiency has been significantly improved. Furthermore, the meshes generated by this algorithm have similar high quality features as that generated by CfCVDT. When complex interfaces are involved, our algorithm can keep the mesh conforming to the interfaces very efficiently. By using various density functions, this algorithm can produce high quality non-uniform meshes for potentially many applications. (C) 2014 Elsevier B.V. All rights reserved.