首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于方向和距离关系的复合空间查询
引用本文:王中辉,闫浩文,杨艳春.基于方向和距离关系的复合空间查询[J].测绘工程,2014,23(11):7-10.
作者姓名:王中辉  闫浩文  杨艳春
作者单位:1. 兰州交通大学测绘与地理信息学院,甘肃兰州,730070
2. 兰州交通大学电子与信息工程学院,甘肃兰州,730070
基金项目:国家科技支撑计划资助项目,数字制图与国土信息应用工程国家测绘地理信息局重点实验室开放研究基金资助项目,兰州交通大学青年科学基金资助项目,地理空间信息工程国家测绘地理信息局重点实验室经费资助项目
摘    要:利用四叉树索引,提出一种基于方向和距离关系的复合空间查询算法.其基本思路是:计算给定的方向区域和距离范围之间的交S,借助四叉树索引快速查找其MBR(Minimum Bounding Rectangle)被S包含或与S相交的空间对象,构成候选集,从候选集中删除不符合给定方向和距离关系的空间对象,得到查询结果.实验表明,算法具有较好的空间查询性能.

关 键 词:四叉树索引  方向关系  距离关系  复合空间查询  算法

Compound spatial query based on direction and distance relations
WANG Zhong-hui,YAN Hao-wen,YANG Yan-chun.Compound spatial query based on direction and distance relations[J].Engineering of Surveying and Mapping,2014,23(11):7-10.
Authors:WANG Zhong-hui  YAN Hao-wen  YANG Yan-chun
Institution:WANG Zhong-hui, YAN Hao-wen, YANG Yan-chun (1. School of Geomatics, Lanzhou Jiaotong University, Lanzhou 730070, China; 2. School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China)
Abstract:An algorithm for compound spatial query based on direction and distance relations is proposed by using quad-tree index. Its basic idea is: first, computing the intersection S of the given direction area and distance range; then, using quad-tree index to search quickly the objects whose MBR (Minimum Bounding Rectangle) contained by S or intersecting with S to construct the candidate set; finally, getting the result by removing the objects not meeting the given direction and distance relations in the candidate set. The experiments show that the algorithm has good performance.
Keywords:quad-tree index  direction relations  distance relations  compound spatial query  algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号