论文信息 - Evaluating the Configuration and the Travel Efficiency on Proximity Graphs as Transportation Networks

Evaluating the Configuration and the Travel Efficiency on Proximity Graphs as Transportation Networks

In this paper, we treat proximity graphs as theoretical road networks and evaluate the configuration and the travel efficiency on proximity graphs. We analyze the configuration of proximity graphs in terms of the length of graph edge and the efficiecy of travel on the graphs to compare with the property of ideal road network pattern. In conclusion, network distance on the relative neighborhood graph which is a kind of proximity graph is similar to rectilinear distance in terms of edge length and travel distance, but is different in terms of ratio to Euclidean distance.

D. Watanabe

[1] P. J. Clark,et al. Distance to Nearest Neighbor as a Measure of Spatial Relationships in Populations , 1954 .

[2] F. Roberts. Random minimal trees , 1968 .

[3] R Collins,et al. A geometrical sum rule for two-dimensional fluid correlation functions , 1968 .

[4] R. E. Miles. On the homogeneous planar Poisson point process , 1970 .

[5] D. K. Pickard. Isolated nearest neighbors , 1982 .

[6] R. Vaughan,et al. Urban spatial traffic patterns , 1987 .

[7] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[8] J. Møller,et al. Lectures on Random Voronoi Tessellations , 1994 .

[9] Masao Furuyama,et al. Theoretical study on the shortest connectivity and neighborhood connectivity for the regional networks , 2003 .

[10] Daisuke Watanabe. A Study on Analyzing Road Network Patterns using Proximity Graphs , 2005, Journal of the City Planning Institute of Japan.