基于空间索引的规则格网DTM内插算法研究

Algorithm for Generating Regular Grid DTM Based on the Spatial Index

从离散点内插规则格网数字地形模型 (DTM)方法的关键是如何提高待插点周围数据的搜索效率。该文针对离散点的空间分布特性 ,给出了基于网格分块和KD -Tree两种空间索引技术的规则格网内插方法。实验表明 ,这两种索引方法能显著提高搜索速度 ,算法内插效率较高。最后 ,在算法效率分析的基础上 ,对两种索引方法所适应的条件进行了讨论。

To generate regular grid digital terrain model (DTM) from scattered points, the key problem is to improve the efficiency of searching neighbor points. Based on the distribution property of scattered points, two spatial index methods, GRID and KD-Tree, are put forward to generate regular grid DTM. The experiment shows that the index methods improve searching speed greatly, and the interpolation algorithm is efficient.At last, the adaptation conditions of above spatial index methods are discussed during their algorithm analysis.