| 摘要: |
| 本文提出了一种基于图的二维任意域内点集的Ｄｅｌａｕｎａｙ三角剖分算法．该算法首先求出任意域内点集的约束最小生成树，然后逐次加入一边构造三角形网格，最后通过局部优化变换，得到二维任意域内点集的Ｄｅｌａｕｎａｙ三角剖分．本文还给出了该算法在有限元网格自动生成过程中的应用. |
| 关键词: 约束最小生成树 任意域 Delaunay三角剖分 有限元网格 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金资助. |
|
| A GRAPH BASED ALGORITHM FOR GENERATING THE DELAUNAY TRIANGULATION OF A POINT SET WITHIN AN ARBITRARY 2D DOMAIN |
|
Pan Zhigeng,Ma Xiaohu,Dong Jun,Shi Jiaoying
|
| Abstract: |
| A graph based algorithm for generating the delaunay triangulation of a point set within an arbitrary 2D domain (denoted as DTAD for short) is presented in this paper. The basic idea is to calculate the CMST(constrained minimum spanning tree) of the given points within an arbitrary 2D domain. The CMST is then augmented to triangle mesh. Finally the DTAD is obtained by local optimal transformation. The actual application of the algorithm in the automatic finite element mesh generation is also shown in the paper. |
| Key words: Constrained minimum spanning tree arbitrary domain delaunay triangulation finite element mesh. |
