摘要
为了克服传统经纬度格网与全球四元三角网(quaternary triangular mesh,QTM)存在的不足,提出了一种球面退化四叉树格网(degenerate quadtree grid,DQG)的剖分方法及相应的格网编码方案,分析了不同位置格网的邻近特征,给出了一套详细的DQG单元邻近搜索算法,并进行了相关实验与对比分析。结果表明,该算法的搜索速度比传统QTM格网的Bartholdi搜索算法和分解搜索算法分别提高了约100倍和30倍。
Adjacent search is the basis of spatial operations, such as spatial aggregation, index, query, and dynamic dilatation, and has become one of the key problems in the global discrete grids researches. In order to overcome some deficiencies in adjacent search based on the traditional latitude/longitude grid or quaternary triangular mesh （QTMs）, a new partition method, called degenerate quadtree grid, and the corresponding grid code scheme are presented in this paper. Firstly, the adjacent characteristics of DQGs in different positions are analyzed. Then, an adjacent searching algorithm of DQGs is given in details. Finally, the experimental analysis is developed and the results demonstrate that the efficiency of adjacent search in this algorithm has been improved by 100 times and 30 times respectively relative to those of traditional Bartholdi algorithm and decomposing algorithm.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2009年第4期479-482,共4页
Geomatics and Information Science of Wuhan University
基金
国家自然科学基金资助项目(40471108
40771169)
