论文部分内容阅读
采用对偶拓扑方法构建基于广义路网拓扑的对偶图,通过引入m阶邻居节点概念,考虑对偶图中节点度、介中心及节点间距离等因素,顾及节点自身及1到m阶邻居节点的重要度贡献,定义节点重要度评价模型,进而提出一种基于对偶图节点重要度评价的道路网自动选取方法。为检验方法的有效性,引入度分布评价所选取道路对路网整体结构及拓扑特性的保持程度,并采用实际城市路网进行试验,结果表明本文方法选取的路网能较好地保持原始路网的整体结构、拓扑特性及道路连通性,且算法稳定、可靠。
The dual graph based on generalized topology of network is constructed by using dual topological method. By introducing the concept of m-th order neighbor nodes, considering the degree of nodes, the center of mesocons and the distance between nodes, the importance of node itself and 1 to m-th neighbor nodes is considered Degree contribution, define the node importance evaluation model, and then put forward a road network automatic selection method based on the importance evaluation of dual graph nodes. In order to test the validity of the method, the degree distribution is introduced to evaluate the degree of maintenance of the overall structure and topological characteristics of the road network selected by the road. The actual urban road network is used to test. The results show that the road network selected by this method can well maintain the original road The overall structure of the network, the topological characteristics and road connectivity, and the algorithm is stable and reliable.