摘要
文章介绍一种基于矢量地图的最优路径搜索算法。首先描述矢量地图库的存储结构,然后提出针对这种特定存储结构的最短路径搜索算法, 并对算法的收敛性加以讨论。算法采用启发式代价树的广度优先搜索法, 其设计思想对于其它类型存储结构的矢量图的路径寻优问题仍有意义。本算法在合肥、厦门等城市的矢量化电子地图的基础上成功实现。
In this paper, an algorithm for seeking optimum path, based on the vector map, was introduced We begin with discussion of a kind of data structure for the vector map, which will be applied in the realization of the algorithm This algorithm introduced scope priority searching method by elicitation cost tree Its design method will still make sense for other types of vector maps This kind of algorithm was successfully achieved on the vector maps of Hefei City and Xiamen City
出处
《微电子学与计算机》
CSCD
北大核心
1999年第5期10-13,共4页
Microelectronics & Computer