节点文献
基于网格划分的几种空间索引
Spatial Indices Based on Grid Partition
【摘要】 分析了基本的规则网格空间索引的优缺点,阐述了基于网格划分的各种改进算法的原理,并且针对地图开窗显示的实际应用,设计了每种算法的实现步骤.通过对改进算法时间复杂度和空间复杂度的分析,得出各自的优缺点和适用程度,并根据实际地图数据编程实现这些算法.实验结果表明,在地图开窗显示方面,理论分析符合实际应用情况,每种改进算法时间复杂度都不超过O(N).
【Abstract】 Based on the fundamental regular grid spatial index, the paper analyzes its advantages and disadvantages, discusses the principles of algorithm improvement based on grid partition, and designs the steps of implementation for each searching algorithm for regional query applications. The time and space complexity of these algorithm improvements are analyzed in detail, and their advantages and disadvantages are presented. Finally, based on practical map data, these searching algorithms are programmed. Experimental results show that for use in region query, analyses in theory accords well with practical applications, and time complexity of every algorithm improvement does not exceed O(N).
【Key words】 geographic information system (GIS); spatial index; complexity;
- 【文献出处】 北京理工大学学报 ,Journal of Beijing Institute of Technology , 编辑部邮箱 ,2004年02期
- 【分类号】TP391.2
- 【被引频次】52
- 【下载频次】940