摘要
Delaunay三角剖分算法是构建数字高程模型(DEM)的主要算法。分析了几种已有Delaunay三角剖分算法后,对前沿边推进算法进行了两点改进。一是直接以边为基础向一侧推进,而不是以凸包为基础向内推进;二是利用分块技术来改进搜索方法,使搜索范围限制在搜索边的周围区域,从而极大地提高了Delaunay三角网的推进速度。仿真实验表明,改进后算法效率有了显著提高。
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.
出处
《系统仿真学报》
EI
CAS
CSCD
北大核心
2006年第11期3055-3057,共3页
Journal of System Simulation
