复杂平面区域的三角网格生成算法Triangular.pdf

30 4 JOURNAL OF NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY Vol. 30 No. 4 2008 : 1001- 2486( 2008) 04- 0094- 04 1, 2 1 陈 欣 , 熊岳山 ( 1. , 410073; 2. , 321004) : , , Delaunay , , Delaunay , , Delaunay , : ; ; ; Delaunay :TP3919 : B Triangular Mesh Generation over Arbitrary Two- dimensional Domain CHEN Xin1, 2 , XIONG Yue- Shan1 (1. College of Computer, National Univ. , of Defense Technology, Changsha 410073, China; 2. School of Mathematics, Physics Information Engineering, Zhejiang Normal Univ. , Jinhua 321004, China) Abstract: A refinemen-t based triangular meshing algorithm is proposed to generate finite element meshes of arbitrary two- dimensional domains. The boundary is triangulated by the ear- removal method, constructing an initial mesh with coarse elements. To meet the pre-specified sizing requirement by refining the initial mesh, a novel mesh refinement method, Delaunay- optimized bisection, is presented. By combining globa-l longes-t edge bisection with Delaunay edge swapping, wel-l shaped triangular elements are constructed. Meshing examples are presented along with mesh statistics, showing that the presented algorithm is capable of generating quality finite element meshes for arbitrary 2D domains. Key words: triangular mesh; mesh generation; mesh refinement; delaunay- optimized bisection [ 1] , [ 1- 2] , ,