發(fā)布時間：2018-06-29 01:40

  本文選題：道路網絡 + 空間鄰近關系�。� 參考：《地理與地理信息科學》2017年03期

【摘要】：基于對偶圖理論提出了一種面向道路網絡的空間鄰近關系分析方法。1)分析了道路網絡空間鄰近關系研究存在的問題,引入了道路網絡拓撲圖及其對偶圖描述道路網絡的結構和關系;2)引入了鄰接矩陣描述對偶圖中頂點之間的鄰接關系,在鄰接矩陣的基礎上,定義了道路網絡的空間鄰近關系;3)提出了一種廣度優(yōu)先搜索算法,計算道路之間的空間鄰近關系階數(shù),并通過實例分析了算法的執(zhí)行過程;4)開發(fā)了一個原型系統(tǒng),描述了道路網絡空間數(shù)據組織方式,并通過實例展示了道路間鄰近關系的計算結果。實驗結果表明:基于對偶圖理論的方法能夠描述道路網絡之間的空間鄰接關系;基于提出的廣度優(yōu)先搜索算法能夠計算出道路之間的空間鄰近階數(shù)。
[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) 中央高校基本科研業(yè)務費專項資金項目(XDJK2015B022)
【分類號】：P208

【相似文獻】

相關期刊論文 前1條

1 鄭年波;陸鋒;段瀅瀅;;道路轉向延遲的動態(tài)對偶圖模型[J];中國圖象圖形學報;2010年06期

，

本文編號：2080257