期刊名称：American Journal of Computational Mathematics
印刷版ISSN：2161-1203
电子版ISSN：2161-1211
出版年度：2012
卷号：2
期号：4
页码：336-340
DOI：10.4236/ajcm.2012.24046
出版社：Scientific Research Publishing
摘要：In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.
关键词：Point-Set in the Plane; Delaunay Triangulation; Removing Circle; Finite Element Mesh
