| 一种动态构建Delaunay三角网的算法 |
| |
| 引用本文： | 赵岩,张子平.一种动态构建Delaunay三角网的算法[J].测绘工程,2008,17(3):24-27. |
| |
| 作者姓名： | 赵岩 张子平 |
| |
| 作者单位： | 河南理工大学,测绘与国土信息工程学院,河南,焦作,454003;河南理工大学,测绘与国土信息工程学院,河南,焦作,454003 |
| |
| 摘 要： | Delaunay三角剖分算法是构建数字高程模（DEM）的主要算法。在分析现有的Delaunay三角剖分的3种算法之后，指出现有算法存在的不足。并提出一种TIN的动态建模方法，利用分块技术来改进搜索方法，大大提高了Delaunay三角网的构建速度。实验结果表明，此算法和前面3种算法相比，效率有了很大提高。
|
| 关 键 词： | DEM Delaunay三角剖分 动态建模 数据分块 |
One dynamic algorithm of constructing Delaunay triangulation |
| |
| ZHAO Yan,ZHANG Zi-ping.One dynamic algorithm of constructing Delaunay triangulation[J].Engineering of Surveying and Mapping,2008,17(3):24-27. |
| |
| Authors: | ZHAO Yan ZHANG Zi-ping |
| |
| Institution: | ZHAO Yan, ZHANG Zi-ping (School of Surveying and Land Information Engineering, Henan Polytechnic University,Jiaozuo 454008,China) |
| |
| Abstract: | The algorithm of Delaunay triangulation is the main algorithm when establishing DEM.In this paper,the limitation of three algorithms is given out after three algorithms are analyzed.One method of dynamic modeling of TIN is put forward.Dataset partition is used to improve the method of search;the speed of constructing Delaunay triangulation is greatly improved.The result of experiment shows that the efficiency of this algorithm is evidently enhanced than those three algorithms. |
| |
| Keywords: | DEM Delaunay triangulation dynamic modeling dataset partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
