郭莹莹,张丽平,李松.障碍环境中线段组最近邻查询方法研究[J].计算机科学,2018,45(6):172-175, 192
障碍环境中线段组最近邻查询方法研究
Group Nearest Neighbor Query Method of Line Segment in Obstacle Space
投稿时间:2017-04-27  修订日期:2017-06-05
DOI:10.11896/j.issn.1002-137X.2018.06.030
中文关键词:  空间数据库,线段障碍距离,线段障碍组最近邻,线段Voronoi图
英文关键词:Spatial database,Line segment obstruction distance,OLGNN,Voronoi diagram of line segment
基金项目:本文受黑龙江省教育厅科学技术研究项目(12531z004)资助
作者单位E-mail
郭莹莹 哈尔滨理工大学计算机科学与技术学院 哈尔滨150080  
张丽平 哈尔滨理工大学计算机科学与技术学院 哈尔滨150080 0703@163.com 
李松 哈尔滨理工大学计算机科学与技术学院 哈尔滨150080  
摘要点击次数: 175
全文下载次数: 124
中文摘要:
      为了解决现有成果无法有效处理障碍环境下的线段组最近邻查询问题,提出了障碍环境中线段组最近邻查询方法。查询过程分为过滤阶段和精炼阶段两个部分。在过滤过程中,首先根据线段Voronoi图的性质以及线段障碍组最近邻查询的定义,提出了针对数据线段的剪枝定理,并提出了OLGNN_Line_Filter算法;根据线段障碍距离的定义,进一步提出针对障碍物的剪枝定理,并给出了OLGNN_Obstacle_Filter算法。在精炼过程中,为了得到更精确的查询结果,提出了相应的精炼定理和精炼算法STA_OLGNN。理论研究和实验表明,所提算法能够有效地处理障碍环境下的线段组最近邻查询问题。
英文摘要:
      In order to make up the deficiencies of the existing research results which can not effectively deal with the group nearest neighbor query based on line segment in obstacle space,the group nearest neighbor query method of line segment in obstacle space was proposed.This query process is divided into two stages,including the filtering process and refining process.In the filtering process,according to the properties of the line segment Voronoi graph and the definition of OLGNN,corresponding pruning theorem of data line was proposed,and the OLGNN_Line_Filter algorithm was put forward.According to the definition of line obstruction distance,corresponding pruning theorem of obstruction was proposed,and the OLGNN_Obstacle_Filter algorithm was put forward.In the refining process,in order to get more accurate query results,the corresponding refining theorem and STA_OLGNN algorithm were proposed.Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of group nearest neighbor query of line segment in obstacle environment.
查看全文  查看/发表评论  下载PDF阅读器