摘要
本文提出了一个改进的自连接Ｄｅｌａｕｎａｙ 三角网生成算法。在原算法的基础上引进了封闭点的概念，在三角网的生成过程中动态地剔除封闭点，从而大大加快了生成新三角形时对点的查找过程。其次，通过对边扩展过程的研究，发现对除了第一个三角形以外的其他三角形实际上只有两条可扩展的边，新算法对这一点也进行了改进。最后，给出了实验的结果数据。
In this paper, we presented an improved algorithm for auto connected Delaunay triangulation. Based on the original algorithm, we proposed the notion of closed point. During the process of triangulation, the closed points are dynamically removed, therefore evidently accelerates the process of searching new point while generating new triangle. Second, according to the observation on edge expanding during the algorithm, we found out that every triangle, except the first one, has actually only two edges that need to be expanded. We also applied this discovery to our algorithm. Last, the experimental result is given.
出处
《计算机应用》
CSCD
1999年第12期10-12,共3页
journal of Computer Applications
基金
国家"九五"重中之重科技攻关项目!(96B020312)
关键词
三角网
三角剖分
生成算法
地图制图
Auto connected triangulation, Dealaunay triangulation, Closed point, List
