Abstract:
In order to improve the efficiency of computing region inclusion relations, this paper proposes an algorithm for computing region inclusion relations based on QR-tree index. The algorithm builds a QR-tree index according to the information of spatial objects and queries all spatial objects including the region on the QR-tree. The algorithm is applied to spatial clustering in GML data based on line-region inclusion relations. Experimental results show that the algorithm is effective and efficient.
Key words:
region inclusion relations,
spatial index,
R-tree,
QR-tree
摘要: 为提高空间拓扑计算中求解面包含关系的效率,提出一种基于QR树索引的面包含关系求解算法。根据空间对象的几何信息建立QR树索引,利用QR树查找面包含的空间对象,并将该算法应用于基于线面包含关系的GML空间聚类。实验结果表明该算法能有效提高计算面包含关系的时间效率。
关键词:
面包含关系,
空间索引,
R树,
QR树
CLC Number:
SUN Xiao-Meng, JI Gen-Lin. Algorithm for Computing Region Inclusion Relations Based on QR-tree Index[J]. Computer Engineering, 2010, 36(21): 37-39.
孙晓明, 吉根林. 基于QR树索引的面包含关系求解算法[J]. 计算机工程, 2010, 36(21): 37-39.