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

GIS领域最短路径搜索问题的一种高效实现
引用本文:王开义,赵春江,胥桂仙,宋晓宇. GIS领域最短路径搜索问题的一种高效实现[J]. 中国图象图形学报, 2003, 8(8): 951-956
作者姓名:王开义  赵春江  胥桂仙  宋晓宇
作者单位:国家农业信息化工程技术研究中心 北京100089(王开义,赵春江),中央民族大学计算机系 北京100081(胥桂仙),国家农业信息化工程技术研究中心 北京100089(宋晓宇)
摘    要:目前在 GIS领域 ,对最短路径搜索问题的研究和应用较多 ,其中最短路径搜索算法的效率问题是普遍关注和在实际应用中迫切需要解决的问题 .通过对基于 Dijkstra最短路径搜索算法的优化途径的分析 ,从算法本身和数据存储结构两个方面同时对此问题的解决方案进行了优化 ,提出了直线优化 Dijkstra算法 ,并进行了必要的证明和适用条件论述 .此方案应用到“全国主要城市间公路信息查询”系统中 ,取得了较为满意的效果 ,同时也给出了相关的测试数据

关 键 词:地理信息系统(420·3040)  Dijkstra  最短路径
文章编号:1006-8961(2003)08-0951-06
修稿时间:2002-11-05

A High-efficiency Realization Way of the Shortest Path Search Problem in GIS Field
WANG Kai-yi,ZHAO Chun-jiang,XU Gui-xian and SONG Xiao-yu. A High-efficiency Realization Way of the Shortest Path Search Problem in GIS Field[J]. Journal of Image and Graphics, 2003, 8(8): 951-956
Authors:WANG Kai-yi  ZHAO Chun-jiang  XU Gui-xian  SONG Xiao-yu
Abstract:There are many researches and applications about the shortest path searching in GIS field at present. Algorithmic efficiency of the shortest path searching is problem which has came to front and need to be resolved in application. In this paper, Author analyzes the optimization means based on the Dijkstra's shortest path algortithm and brings forward his optimization schemes beeline optimizing Dijkstra's shortest path algortithm from two aspects optimization of algortithm and data storage configuration. At same time, author discusses necessary testifying and application conditions in this paper. This scheme was applied in China Main City Highway Information Searching System, and has got satisfied effects. This paper also offers concerned testing data about Beeline Optimizing Dijkstra's Shortest Path Algortithm.
Keywords:GIS   Dijkstra   The shortest path
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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