|
|||||
|
|
| 一种改进的快速Delaunay三角剖分算法 | |
| 引用本文： | 何俊,戴浩,谢永强,刘宝生.一种改进的快速Delaunay三角剖分算法[J].系统仿真学报,2006,18(11):3055-3057. |
| 作者姓名： | 何俊 戴浩 谢永强 刘宝生 |
| 作者单位： | 1. 解放军理工大学指挥自动化学院,江苏,南京,210007;解放军通信指挥学院,湖北,武汉,430010 2. 中国电子设备系统工程公司研究所,北京,100039 3. 解放军理工大学指挥自动化学院,江苏,南京,210007 |
| 摘 要： | Delaunay三角剖分算法是构建数字高程模型(DEM)的主要算法。分析了几种已有Delaunay三角剖分算法后,对前沿边推进算法进行了两点改进。一是直接以边为基础向一侧推进,而不是以凸包为基础向内推进;二是利用分块技术来改进搜索方法,使搜索范围限制在搜索边的周围区域,从而极大地提高了Delaunay三角网的推进速度。仿真实验表明,改进后算法效率有了显著提高。 |
| 关 键 词： | 数字高程模型 Delaunay三角剖分 数据分块 三角网生长算法 |
| 文章编号： | 1004-731X（2006）11-3055-03 |
| 收稿时间： | 2005-08-17 |
| 修稿时间： | 2006-04-28 |
Fast Improved Delaunay Triangulation Algorithm |
|
| HE Jun,DAI Hao,XIE Yong-qiang,LIU Bao-sheng.Fast Improved Delaunay Triangulation Algorithm[J].Journal of System Simulation,2006,18(11):3055-3057. | |
| Authors: | HE Jun DAI Hao XIE Yong-qiang LIU Bao-sheng |
| Abstract: | The algorithms of Delaunay triangulation are the main algorithms when establishing DEM. The algorithm of going forward beginning with margins was improved in two ways after some researches are made on several Delaunay triangulation algorithms. On one hand, the edges were used as the base when going forward, other than Vononoi figure as the base. On the other hand, data set partition was used to limit the range of searching. Consequently, the speed of constructing Delaunay triangle was greatly improved. The result of simulating shows that the efficiency of mended algorithm is evidently enhanced. |
| Keywords: | DEM Delaunay triangulation data set partition triangulation growth algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |