Faculty of Marine Technology, Tokyo University of Marine Science and Technology, 2-1-6, Etchujima, Koto-ku, Tokyo 135-8533, Japan
E-mail address: email@example.com
(Received May 31, 2008; Accepted October 27, 2008)
Abstract. 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.
Keywords: Transportation Network, Proximity Graph, Computational Geometry, Geometric Probability