Computing the Fewest-turn Map Directions based on the Connectivity of Natural Roads - Computer Science > Computational GeometryReportar como inadecuado




Computing the Fewest-turn Map Directions based on the Connectivity of Natural Roads - Computer Science > Computational Geometry - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: In this paper, we introduced a novel approach to computing the fewest-turnmap directions or routes based on the concept of natural roads. Natural roadsare joined road segments that perceptually constitute good continuity. Thisapproach relies on the connectivity of natural roads rather than that of roadsegments for computing routes or map directions. Because of this, the derivedroutes posses the fewest turns. However, what we intend to achieve are theroutes that not only possess the fewest turns, but are also as short aspossible. This kind of map direction is more effective and favorable by people,because they bear less cognitive burden. Furthermore, the computation of theroutes is more efficient, since it is based on the graph encoding theconnectivity of roads, which is significantly smaller than the graph of roadsegments. We made experiments applied to eight urban street networks from NorthAmerica and Europe in order to illustrate the above stated advantages. Theexperimental results indicate that the fewest-turn routes posses fewer turnsand shorter distances than the simplest paths and the routes provided by GoogleMaps. For example, the fewest-turn-and-shortest routes are on average 15%shorter than the routes suggested by Google Maps, while the number of turns isjust half as much. This approach is a key technology behind FromToMap.org - aweb mapping service using openstreetmap data.



Autor: Bin Jiang, Xintao Liu

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados