基于不确定Voronoi图的概率障碍最近邻查询

Probabilistic obstructed nearest neighbor queries based on uncertain-Voronoi diagram

障碍最近邻查询是针对存在障碍物情况下的一类最近邻查询问题,在地理信息系统以及存在障碍的空间分析等领域有着重要的应用价值。不确定对象的障碍最近邻查询问题将不确定因素引入到障碍最近邻查询中,使其更贴近现实需求。针对不确定对象的障碍最近邻查询问题,提出不确定对象的障碍距离和障碍作用集等概念,利用不确定Voronoi图的性质,提出基于不确定Voronoi图的概率障碍最近邻查询算法,实验结果表明,提出的算法具有较好的性能。

Obstructed nearest neighbor queries is a type of nearest neighbor queries for the existence of obstacles. It has important application value in the field of geographic information system, spatial analysis for existing obstacles and so on. The obstructed nearest neighbor queries for uncertain objects introduce uncertain factors into nearest neighbor queries, which make it more close to the reality demand. The concepts such as obstructed distance and obstructed active set of uncertain objects are put forward in consideration of the problem of obstructed nearest neighbor queries for uncertain objects. By considering the characteristics of uncertain-voronoi diagram, the algorithm is presented which deals with the probabilistic obstructed nearest neighbor queries based on uncertain-voronoi diagram. Experimental results indicate that the algorithm presented has a better performance.