基于道路网络分析的Voronoi面域图构建算法  

Algorithm for Constructing Voronoi Area Diagram Based on Road Network Analysis

作　　者：谢顺平[1] 冯学智[1] 鲁伟[1] 

机构地区：[1]南京大学地理与海洋科学学院,江苏南京210093

出　　处：《测绘学报》2010年第1期88-94,共7页Acta Geodaetica et Cartographica Sinica

基　　金：国家863计划(2008AA12Z106);国家自然科学基金(40401046)

摘　　要：提出一种基于网络分析的Voronoi面域图和加权Voronoi面域图构建算法。鉴于道路网络在城市中心地、公共设施引力传导与功能覆盖上的重要作用,采用网络最短路径距离分析和最短路径时间分析构建的Voronoi面域图可以模拟出中心功能的辐射影响范围空间划分的实际情形,进而为空间分析和空间优化提供有力支持。算法过程主要包括:设施邻近道路结点检索和分界结点计算;基于网络最短路径分析Dijkstra算法和分界结点计算的网络Voronoi划分;基于空间离散化、邻近道路分析的空间Voronoi划分及其矢量化处理算法。计算实验结果表明本文提出算法可靠和高效,能够模拟出具有预期精度和形态复杂的网络Voronoi面域图形。An algorithm for constructing Voronoi area diagram and weighted Voronoi area diagram based on road network analysis is proposed in this paper. In view of the factor that road network system plays an important role in the influence conducting and function covering of urban centers and public facilities, network Voronoi diagram constructed by analyzing network shortest path and network shortest path time can simulate the practical situation of spatial partition for different central influences, which can be used to support spatial analysis and spatial optimization. The algorithm procedure, including the searches for adjacent road node of facilities, border node computation, the Voronoi partition of road network based on network shortest path analysis with Dijkstra algorithm, spatial Voronoi partition based on network Voronoi partition and adjacent road analysis, and raster vectorization are presented. The result of computational experiments shows that the proposed algorithm is of reliable and efficient and it can simulate network Voronei diagrams with expectant precision and complex modality, and has flexibility and practical value.

关 键 词：网络Vo ronoi面域图 网络分析 空间划分 功能辐射域 路径时间距离 

分 类 号：P208[天文地球—地图制图学与地理信息工程]