摘要
简单回顾了生成Delaunay三角网的分治算法、逐点插入法、三角网生长法等三类主流算法 ,提出了一种基于逐点插入思想的快速、有效的分区逐点插入三角化算法 ,实现了平面域上离散数据点的三角化。网格的优化是在网格生成过程中完成的 。
After reviewing simply prevalent generation algorithms of Delaunay triangulation, divideconquer, incremental insertion and triangulation growth,presents a fast and efficient triangulation algorithm on the base of incremental insertion,the scattered data on 2D shape are triangulated by this algorithm.Triangular mesh optimization is done at the same time with mesh creating,the resulted mesh is fit to Delaunay criteria.
出处
《计算机与现代化》
2002年第11期8-10,共3页
Computer and Modernization
