|Table of Contents|

[1] Wang Desheng, Wan Shui,. Robust Delaunay Tetrahedronal Meshing Coupledwith Advancing Front Method [J]. Journal of Southeast University (English Edition), 2002, 18 (2): 131-135. [doi:10.3969/j.issn.1003-7985.2002.02.007]
Copy

Robust Delaunay Tetrahedronal Meshing Coupledwith Advancing Front Method()
与波前法相结合的Delaunay四面体网格生成方法
Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
18
Issue:
2002 2
Page:
131-135
Research Field:
Mathematics, Physics, Mechanics
Publishing date:
2002-06-30

Info

Title:
Robust Delaunay Tetrahedronal Meshing Coupledwith Advancing Front Method
与波前法相结合的Delaunay四面体网格生成方法
Author(s):
Wang Desheng1;  Wan Shui2
1Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China
2College of Traffic and Transportation Engineering, Southeast University, Nanjing 210096, China
王德生1;  万水2
1中国科学院数学与系统科学研究院数学研究所, 北京 100080; 2东南大学交通学院, 南京 210096
Keywords:
tetrahedronal meshing;  Delaunay method;  advancing front technique;  boundary meshing
四面体网格;  Delaunay 方法;  波前法;  边界网格生成
PACS:
O242.21
DOI:
10.3969/j.issn.1003-7985.2002.02.007
Abstract:
A full automatic tetrahedronal mesh generation method for arbitrary 3D domains is described. First, the classic Delaunay method is coupled with simplified advancing front technique(AFT)to obtain the boundary mesh. Then, advancing-front high-quality point placement is used to generate internal points with optimal positions and a Delaunay method is used to insert them efficiently. Finally, optimization procedures are used for mesh quality improvements. Several application examples are presented to demonstrate the robustness and efficiency of the proposed meshing scheme.
描述了一种在任意三维区域自动生成四面体网格的方法.首先, 将经典的 Delaunay 方法与简化的波前法相结合, 进行边界四面体剖分, 解决边界还原问题.然后, 再次将Delaunay方法与波前法相结合, 产生具有最优位置的内部节点, 并用Delauny方法将内部节点高效率地插入.最后, 进行网格优化以提高网格的质量.文中的应用算例显示, 本文提出的网格生成方法具有很强的健壮性和高效率.

References:

[1] Baker T J. Automatic mesh generation for complex three-dimensional region using a constrained delaunay triangulation [J]. Engrg Comput, 1989, 5:161-175.
[2] George P L, Hecht F, Saltel E. Automatic mesh generation with specified boundary [J]. Comp Meth Appl Mech Engrg, 1991, 92:169-188.
[3] Lohner R, Parikh P. Three-dimensional grid generation by the advancing-front method [J]. Int J Numer Methods Fluids, 1988, 8:1135-1149.
[4] Rassineux A. Generation and optimization of tetrahedral meshes by advancing front technique[J]. Int J Numer Methods Engrg, 1998, 41:651-674.
[5] Jin H, Tanner R I. Generation of unstructured tetrahedronal meshes by advancing front technique [J]. Int J Numer Methods Engrg, 1993, 6:1805-1823.
[6] Lohner R. Generation of three-dimensional unstructured grids by the advancing-front method [J]. Int J Numer Methods Fluids, 1988, 8:1135-1149.
[7] Frey P J, Borouchaki H, George P L. 3D delaunay mesh generation coupled with an advancing front approach [J]. Comput Meth Appl Mech Engrg, 1998, 157:115-131.
[8] Borouchaki H, George P L, Lo S H. Optimal delaunay point insertion [J]. Int J Numer Methods Engrg, 1996, 39:3407-3437.
[9] Schroeder W J, Shepard M S. A combined octree/delaunay method for fully automatic 3-D mesh generation [J]. Int J Numer Methods Engrg, 1990, 29:37-55.

Memo

Memo:
* Born in 1972, male, postdoctor.
Last Update: 2002-06-20