| 一种Delaunay三角网的快速生成算法 |
| |
| 引用本文： | 方勇,刘鹏,胡海彦.一种Delaunay三角网的快速生成算法[J].测绘科学与工程,2006,26(3):1-4. |
| |
| 作者姓名： | 方勇 刘鹏 胡海彦 |
| |
| 作者单位： | [1]西安测绘研究所研究员 [2]不详 |
| |
| 摘 要： | 本文以Lawson提出的逐点插入法为基础，借鉴方向搜索的思想，在确定插入点的影响凸包时，采用递归的局部搜索策略，形成了一种Delaunay三角网的快速生成算法。实验证明，新算法构网时间与点数基本成线性增长关系，具有较高的效率。
|
| 关 键 词： | Delaunay 三角网 有向搜索 |
A Fast Algorithm of Delaunay Triangulation Generation |
| |
| Fang Yong ,Liu Peng, Hu Haiyan.A Fast Algorithm of Delaunay Triangulation Generation[J].Geomatic Science and Engineering,2006,26(3):1-4. |
| |
| Authors: | Fang Yong Liu Peng Hu Haiyan |
| |
| Abstract: | 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. |
| |
| Keywords: | Delaunay triangulation directional search |
| 本文献已被 维普 等数据库收录！ |
