摘要
本文以Lawson提出的逐点插入法为基础，借鉴方向搜索的思想，在确定插入点的影响凸包时，采用递归的局部搜索策略，形成了一种Delaunay三角网的快速生成算法。实验证明，新算法构网时间与点数基本成线性增长关系，具有较高的效率。
Based on the point - by - point interplation algorithm brought by Lawson and the directional search , a fast algorithm of Delaunay triangulation generation is formed. In this algorithm , a recursive local search strategy is used to determine the convex hull of inserted point. The experiment indicates that this new algorithm is efficient, and the time cost for constructing a triangulation network increases linearly with the number of points.
出处
《测绘科学与工程》
2006年第3期1-4,共4页
Geomatics Science and Engineering
