基于对偶图的道路网络空间邻近关系分析初探

发布时间：2018-06-29 01:40

本文选题：道路网络 + 空间邻近关系　；参考：《地理与地理信息科学》2017年03期

【摘要】：基于对偶图理论提出了一种面向道路网络的空间邻近关系分析方法。1)分析了道路网络空间邻近关系研究存在的问题,引入了道路网络拓扑图及其对偶图描述道路网络的结构和关系;2)引入了邻接矩阵描述对偶图中顶点之间的邻接关系,在邻接矩阵的基础上,定义了道路网络的空间邻近关系;3)提出了一种广度优先搜索算法,计算道路之间的空间邻近关系阶数,并通过实例分析了算法的执行过程;4)开发了一个原型系统,描述了道路网络空间数据组织方式,并通过实例展示了道路间邻近关系的计算结果。实验结果表明:基于对偶图理论的方法能够描述道路网络之间的空间邻接关系;基于提出的广度优先搜索算法能够计算出道路之间的空间邻近阶数。
[Abstract]:Based on the bigraph theory, this paper presents a method for analyzing the spatial proximity relation of road network. (1) the problems in the study of spatial proximity relation of road network are analyzed. The topological graph of road network and its dual graph are introduced to describe the structure and relation of road network. (2) the adjacency matrix is introduced to describe the adjacency between vertices in a bipartite graph. On the basis of the adjacency matrix, the adjacent matrix is introduced. In this paper, the spatial proximity relation of road network is defined. A breadth-first search algorithm is proposed to calculate the order of spatial proximity relationship between roads. An example is given to analyze the implementation process of the algorithm. The spatial data organization of road network is described, and the calculation results of the adjacent relationship between roads are demonstrated by an example. The experimental results show that the method based on the dual graph theory can describe the spatial adjacency between road networks, and the spatial proximity order between roads can be calculated based on the proposed breadth-first search algorithm.
【作者单位】：西南大学地理科学学院;江西理工大学建筑与测绘工程学院;
【基金】：国家自然科学基金(41301417、41361077) 重庆市基础与前沿计划项目(cstc2014jcyjA20017) 中央高校基本科研业务费专项资金项目(XDJK2015B022)
【分类号】：P208

【相似文献】