障碍物环境中的路网最近邻查询方法  

Methods of nearest neighbor guery in road network with barriers

作　　者：李林 张丽平[2] 李松[3] 

机构地区：[1]浙江浙大网新众合轨道交通工程有限公司设计中心,杭州310007 [2]辽宁工程技术大学电子与信息工程学院,葫芦岛125105 [3]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《铁路计算机应用》2009年第11期37-40,共4页Railway Computer Application

摘　　要：路网中的最近邻查询在地理信息系统﹑电子地图﹑卫星定位﹑空间数据挖掘和空间查询等多方面具有重要作用。为处理障碍物环境下道路网中的最近邻查询问题,采用基于Voronoi图的概念和性质对障碍物环境中的路网最近邻查询问题进行详细分析,给出相关查询策略和查询算法。实验分析表明,该方法可较好地解决障碍物环境下道路网络中最近邻查询问题。The nearest neighbor query of the datasets in the road network was important in the Geographical Information Systems（GIS）, electronic map, satellite positioning, spatial data mining and spatial query. To deal with the nearest neighbor query in the road network with barriers, based on the Voronoi diagram, the detailed analysis about the methods of the nearest neighbor query in the road network with barriers were given. Furthermore, the query strategy and the query algorithm were also proposed. The experimental analysis showed that the methods could deal with the nearest neighbor query in the road netork with barriers better.

关 键 词：路网 空间数据库 最近邻 VORONOI图 

分 类 号：U412.36[交通运输工程—道路与铁道工程]