Abstract
We provide an implementation of an exact route planning algorithm on a mobile device that answers shortest-path queries in a road network of a whole continent instantaneously, i.e., with a delay of about 100 ms which is virtually not observable for a human user. Our main algorithmic contribution of is a highly compressed blocked representation of the underlying hierarchical graph and a new fast yet compact route reconstruction data structure. Our representation exploits the locality properties of the graph using a very simple algorithm that does not use any a priori information. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sanders, P., Schultes, D., & Vetter, C. (2008). Mobile route planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 732–743). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
