Road network is a corridor system that interacts with surrounding landscapes,and understanding their interaction helps to develop an optimal plan for sustainable transportation and land use.This study investigates the...Road network is a corridor system that interacts with surrounding landscapes,and understanding their interaction helps to develop an optimal plan for sustainable transportation and land use.This study investigates the relationships between road centrality and landscape patterns in the Wuhan Metropolitan Area,China.The densities of centrality measures,including closeness,betweenness,and straightness,are calculated by kernel density estimation(KDE).The landscape patterns are characterized by four landscape metrics,including percentage of landscape(PLAND),Shannon′s diversity index(SHDI),mean patch size(MPS),and mean shape index(MSI).Spearman rank correlation analysis is then used to quantify their relationships at both landscape and class levels.The results show that the centrality measures can reflect the hierarchy of road network as they associate with road grade.Further analysis exhibit that as centrality densities increase,the whole landscape becomes more fragmented and regular.At the class level,the forest gradually decreases and becomes fragmented,while the construction land increases and turns to more compact.Therefore,these findings indicate that the ability and potential applications of centrality densities estimated by KDE in quantifying the relationships between roads and landscapes,can provide detailed information and valuable guidance for transportation and land-use planning as well as a new insight into ecological effects of roads.展开更多
In land-use data generalization, the removal of insignificant parcel withsmall size is the most frequently used operator. Traditionally for the generalization method, thesmall parcel is assigned completely to one of i...In land-use data generalization, the removal of insignificant parcel withsmall size is the most frequently used operator. Traditionally for the generalization method, thesmall parcel is assigned completely to one of its neighbors. This study tries to improve thegeneralization by separating the insignificant parcel into parts around the weighted skeleton andassigning these parts to different neighbors. The distribution of the weighted skeleton depends onthe compatibility between the removed object and its neighbor, which considers not only topologicalrelationship but also distance relationship and semantic similarity. This process is based on theDelaunay triangulat'on model. This paper gives the detailed geometric algorithms for this operation.展开更多
The progressive transmission of map data on the World Wide Web provides the user with a self-adaptive strategy to access remote data. It not only speeds up the web transfer but also offers an efficient navigation guid...The progressive transmission of map data on the World Wide Web provides the user with a self-adaptive strategy to access remote data. It not only speeds up the web transfer but also offers an efficient navigation guide for information acquisition. The key technology in this transmission is the efficient multiple representation of spatial data and pre-organization on the server site. This paper aims at progressive transmission investigating some constraints from three aspects: data organization on server site, data control in the transmission process and data restore after reaching the client. Two strategies, namely on-line map generalization and off-line map generalization, are examined respectively for this kind of progressive transmission.展开更多
可达性是在空间分布格局、设施约束等综合条件下的空间决策问题,等时线模型为该决策分析可提供方法支持,它是以时间地理为框架,用时间成本来衡量时空可达性的重要模型。面向兴趣点(Point of Interest,POI)可达性分析通常包括2种形式:①...可达性是在空间分布格局、设施约束等综合条件下的空间决策问题,等时线模型为该决策分析可提供方法支持,它是以时间地理为框架,用时间成本来衡量时空可达性的重要模型。面向兴趣点(Point of Interest,POI)可达性分析通常包括2种形式:①基于"供给"角度从特定POI出发的服务可达分析;②基于"需求"角度从任意空间位置出发获得最近服务的便利度分析。目前的研究从"供给"角度探求特定POI的服务范围居多,对"需求"角度的等时线分析关注不够。本研究针对这一缺陷,开展面向服务需求的兴趣点可达性等时线分析,考察任意位置达到某类服务设施最近点的时间代价。在几何度量方法上,本研究利用了网络空间Voronoi图模型,与传统欧氏空间Voronoi图相比,本方法顾及了街道网络对空间通达的直接影响。本研究发现了等时线的形态、坡度等特征能够反映POI的疏密分布和道路网的通达性。展开更多
基金Under the auspices of National Key Technology Research and Development Program of China(No.2012BAH28B02)
文摘Road network is a corridor system that interacts with surrounding landscapes,and understanding their interaction helps to develop an optimal plan for sustainable transportation and land use.This study investigates the relationships between road centrality and landscape patterns in the Wuhan Metropolitan Area,China.The densities of centrality measures,including closeness,betweenness,and straightness,are calculated by kernel density estimation(KDE).The landscape patterns are characterized by four landscape metrics,including percentage of landscape(PLAND),Shannon′s diversity index(SHDI),mean patch size(MPS),and mean shape index(MSI).Spearman rank correlation analysis is then used to quantify their relationships at both landscape and class levels.The results show that the centrality measures can reflect the hierarchy of road network as they associate with road grade.Further analysis exhibit that as centrality densities increase,the whole landscape becomes more fragmented and regular.At the class level,the forest gradually decreases and becomes fragmented,while the construction land increases and turns to more compact.Therefore,these findings indicate that the ability and potential applications of centrality densities estimated by KDE in quantifying the relationships between roads and landscapes,can provide detailed information and valuable guidance for transportation and land-use planning as well as a new insight into ecological effects of roads.
文摘In land-use data generalization, the removal of insignificant parcel withsmall size is the most frequently used operator. Traditionally for the generalization method, thesmall parcel is assigned completely to one of its neighbors. This study tries to improve thegeneralization by separating the insignificant parcel into parts around the weighted skeleton andassigning these parts to different neighbors. The distribution of the weighted skeleton depends onthe compatibility between the removed object and its neighbor, which considers not only topologicalrelationship but also distance relationship and semantic similarity. This process is based on theDelaunay triangulat'on model. This paper gives the detailed geometric algorithms for this operation.
基金Supported by the National Natural Science Foundation of China(No.40971242)the National High Technology Research and Development Program of China(No.2007AA12Z209,No.2009AA121404)
文摘The progressive transmission of map data on the World Wide Web provides the user with a self-adaptive strategy to access remote data. It not only speeds up the web transfer but also offers an efficient navigation guide for information acquisition. The key technology in this transmission is the efficient multiple representation of spatial data and pre-organization on the server site. This paper aims at progressive transmission investigating some constraints from three aspects: data organization on server site, data control in the transmission process and data restore after reaching the client. Two strategies, namely on-line map generalization and off-line map generalization, are examined respectively for this kind of progressive transmission.
文摘可达性是在空间分布格局、设施约束等综合条件下的空间决策问题,等时线模型为该决策分析可提供方法支持,它是以时间地理为框架,用时间成本来衡量时空可达性的重要模型。面向兴趣点(Point of Interest,POI)可达性分析通常包括2种形式:①基于"供给"角度从特定POI出发的服务可达分析;②基于"需求"角度从任意空间位置出发获得最近服务的便利度分析。目前的研究从"供给"角度探求特定POI的服务范围居多,对"需求"角度的等时线分析关注不够。本研究针对这一缺陷,开展面向服务需求的兴趣点可达性等时线分析,考察任意位置达到某类服务设施最近点的时间代价。在几何度量方法上,本研究利用了网络空间Voronoi图模型,与传统欧氏空间Voronoi图相比,本方法顾及了街道网络对空间通达的直接影响。本研究发现了等时线的形态、坡度等特征能够反映POI的疏密分布和道路网的通达性。
