A quantitative approach to measure road network information based on edge diversity

2015 ◽  
Author(s):  
Xun Wu ◽  
Hong Zhang ◽  
Tian Lan ◽  
Weiwei Cao ◽  
Jing He
GEOMATICA ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 85-99 ◽  
Author(s):  
Xuejing Xie ◽  
Guojian Ou

Pedestrian network information plays an important role in pedestrian location based service (LBS), and its completeness determines the quality of a pedestrian LBS. This study used volunteered data and BaiduMap to research how to extract pedestrian network information on the basis of pedestrian GPS trajectories. The method extracts human road information by three steps: cleaning track data, extracting the road network, and detecting and analysing the recognised pedestrian road facilities. Once the road network information is extracted, the information regarding road facilities can be obtained, e.g., pedestrian crossings, overpasses, and underground passages. This paper describes a new method for incrementally updating electronic maps.


Author(s):  
Per Skoglar ◽  
Umut Orguner ◽  
David Törnqvist ◽  
Fredrik Gustafsson

Author(s):  
C. Mi ◽  
F. Lu

<p><strong>Abstract.</strong> With the gradual opening of floating car trajectory data, it is possible to extract road network information from it. Currently, most road network extraction algorithms use unified thresholds to ignore the density difference of trajectory data, and only consider the trajectory shape without considering the direction of the trajectory, which seriously affects the geometric precision and topological accuracy of their results. Therefore, an adaptive radius centroid drift clustering method is proposed in this paper, which can automatically adjust clustering parameters according to the track density and the road width, using trajectory direction to complete the topological connection of roads. The algorithm is verified by the floating car trajectory data of a day in Futian District, Shenzhen. The experimental results are qualitatively and quantitatively analyzed with ones of the other two methods. It indicates that the road network data extracted by this algorithm has a significant improvement in geometric precision and topological accuracy, and which is suitable for big data processing.</p>


Networks ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 393-406 ◽  
Author(s):  
Hamza Ben Ticha ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Alain Quilliot

2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Hamza Ben Ticha ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Alain Quilliot ◽  
Tom Van Woensel

2021 ◽  
Vol 30 (4) ◽  
pp. 539-565
Author(s):  
Aaron Bramson ◽  
◽  
Kazuto Okamoto ◽  
Megumi Hori ◽  
◽  
...  

Walkability analyses have gained increased attention for economic, environmental and health reasons, but the methods for assessing walkability have yet to be broadly evaluated. In this paper, five methods for calculating walkability scores are described: in-radius, circle buffers, road network node buffers, road network edge buffers and a fully integrated network approach. Unweighted and various weighted versions are analyzed to capture levels of preference for walking longer distances. The methods are evaluated via an application to train stations in central Tokyo in terms of accuracy, similarity and algorithm performance. The fully integrated network method produces the most accurate results in the shortest amount of processing time, but requires a large upfront investment of time and resources. The circle buffer method runs a bit slower, but does not require any network information and when properly weighted yields walkability scores very similar to the integrated network approach.


Sign in / Sign up

Export Citation Format

Share Document