摘要
采用对偶拓扑方法构建基于广义路网拓扑的对偶图,通过引入m阶邻居节点概念,考虑对偶图中节点度、介中心及节点间距离等因素,顾及节点自身及1到m阶邻居节点的重要度贡献,定义节点重要度评价模型,进而提出一种基于对偶图节点重要度评价的道路网自动选取方法。为检验方法的有效性,引入度分布评价所选取道路对路网整体结构及拓扑特性的保持程度,并采用实际城市路网进行试验,结果表明本文方法选取的路网能较好地保持原始路网的整体结构、拓扑特性及道路连通性,且算法稳定、可靠。
The dual graph is constructed based on the generalized topological road network by using dual topology method. By introducing the concept of m-order neighbors and taking into account the factors of the node＇s degree, betweenness centrality and distance within the dual graph, the importance contributions of the node-self and first to m-order neighbors and defining the evaluation model for node importance is considered. Based on this, a road selection process based on the evaluation of node importance for dual graph is proposed. In order to verify the efficiency of this process, the degree distribution is introduced to evaluate the level of maintaining the global structure and topological characteristics of road network, and real urban road network is used for experiments. The results show that this road selection process can maintain the global structure and topological characteristics of the original road network, keep the selected road network well connected, and also this method is stable and reliable.
出处
《测绘学报》
EI
CSCD
北大核心
2014年第1期97-104,共8页
Acta Geodaetica et Cartographica Sinica
基金
高等学校博士学科点专项科研基金(20100184110019)
西南交通大学博士研究生创新基金
西南交通大学优秀博士学位论文培育项目
中央高校基本科研业务费专项资金
重庆市教委科学技术研究项目(KJ120528)
数字制图与国土信息应用工程国家测绘地理信息局重点实验室开放基金(DM2013SC02)
关键词
地图综合
道路选取
重要度贡献
介中心
节点度
map generalization
road selection
importance contribution
betweennesscentrality
degree of node
