| GIS网络分析中最短路径的实现 |
| |
| 引用本文： | 王秀斌.GIS网络分析中最短路径的实现[J].测绘科学,2007,32(5):61-62. |
| |
| 作者姓名： | 王秀斌 |
| |
| 作者单位： | 福建省地图出版社,福州,350003 |
| |
| 摘 要： | 本文提出了一种基于矢量角度的最短路径搜索算法,设计出一种类似于面向对象的数据存储结构来存储网络图中的节点及弧段对象,在最短路径的搜索上引入矢量夹角标量值作为搜索因子,充分利用了网络图中各点元素和线元素间的拓扑关系,提高了搜索的趋势性,同时还考虑了各弧段的长度值(或权值),较好的将网络图中对象的空间信息和属性信息相结合。
|
| 关 键 词： | 最短路径 矢量角度 拓扑关系 |
| 文章编号： | 1009-2307（2007）05-0061-02 |
| 修稿时间： | 2007-05-22 |
Realization of the shortest path in GIS network analysis |
| |
| WANG Xiu-bin.Realization of the shortest path in GIS network analysis[J].Science of Surveying and Mapping,2007,32(5):61-62. |
| |
| Authors: | WANG Xiu-bin |
| |
| Abstract: | Based on vector angle,a shortest path search algorithm is proposed in this paper firstly.Then a data storage structure,similar to the object-oriented structure,is designed to store nodes and arcs in the network diagram.During the shortest path search,vector angle scalar value is used as search factor,which can make full use of topological relation between point element and line element in a network diagram and can improve search trends.Moreover,each arc length(or power) is considered to make a perfect integration of object spatial information and attribute information in the network diagram. |
| |
| Keywords: | shortest path vector angle topological relation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
