 Estimation of geometric route distance from its topological distance: application to narrow road networks in TokyoHiroyuki Usui ()
Journal of Geographical Systems, 2018, vol. 20, issue 4, No 4, 387-412 Abstract: Abstract The structure of road networks has been investigated in accordance with the development of GIScience. By classifying road networks into wide and narrow ones, we can define the route as the path from the route’s origin (also called the root) on a wide road network to a narrow road segment which consists of the sequence of narrow road segments arranged by ascending order of the number of steps of adjacency to its root. The length of the route can be defined with the following geometric and topological terms: the route distance, measuring the length along the route and the depth, counting the number of road segments on the route. The depth plays the important role of being a substitute for the route distance in modelling road networks as a planar graph. Since road networks clearly exhibit irregular patterns and road segment lengths are non-uniform, it is considered appropriate to adopt a stochastic approach rather than a deterministic one to analyse the route distance. However, the relationship between the route distance and its depth has not been sufficiently investigated stochastically. Therefore, the research question is how can we estimate the route distance from its depth? Based on an empirical study in the Tokyo metropolitan region, it was found that (1) the statistical distribution of the route distance can be formulated as an Erlang distribution whose parameters are its depth and the inverse of the mean length of narrow road segments, and (2) this length is constant and close to 40 m. Therefore, we can estimate the route distance from only one parameter, the depth. Also, as a practical application, accessibility to the kth depth link in terms of firefighting was evaluated because the maximum length of the extension of fire hoses is approximately 200 m. It was found that (1) even if k ≤ 5, the probability that the route distance to the kth depth link is equal to or longer than 200 m ranges from 0 to 0.45; and (2) if k ≥ 8, the probability is approximately 1. These indicate the limitation of the deterministic approach because, on the basis of complete grid patterns (with intervals of 40 m between intersections), k = 5 corresponds to a distance of 200 m from wide road networks and the route to the 5th depth link can be covered with fire hoses. Moreover, it was found that the connectivity of wide road networks is higher than that of narrow ones in terms of the smaller ratio of cul-de-sacs and the larger ratio of four-way intersections. These answers contribute substantially not only to constructing a science of cities that provides a simple model and specifies the most important parameter, but also to our understanding of the structure of narrow road networks within several hundred metres of wide road networks. Keywords: Road network distance; Euclidian distance; Intersection; Topological distance (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:kap:jgeosy:v:20:y:2018:i:4:d:10.1007_s10109-018-0276-3 Ordering information: This journal article can be ordered from DOI: 10.1007/s10109-018-0276-3 Access Statistics for this article Journal of Geographical Systems is currently edited by Manfred M. Fischer and Antonio Páez More articles in Journal of Geographical Systems from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.