Real-time routing with OpenStreetMap data

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2011, Pages 513-516

  Luxen, Dennis ^a   Vetter, Christian ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b Nokia gate5 GmbH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA QUALITY; GOOGLE MAPS; HAND-HELD DEVICES; MAP DATA; ONBOARD NAVIGATION; REAL-TIME FEATURES; REAL-TIME ROUTING; ROUTING SERVICES; SHORTEST PATH COMPUTATIONS; SPATIAL DATA; STREET SEGMENTS;

GEOGRAPHIC INFORMATION SYSTEMS; HAND HELD COMPUTERS; INFORMATION SYSTEMS; WEBSITES;

REAL TIME SYSTEMS;

EID: 84856455618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2093973.2094062     Document Type: Conference Paper

References (15)

1. R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 15(2.3):1-31, January 2010. Special Section devoted to WEA'08.
2. D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering Route Planning Algorithms. In J. Lerner, D. Wagner, and K. A. Zweig, editors, Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009.
3. D. H. DOUGLAS and T. K. PEUCKER. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: The International Journal for Geographic Information and Geovisualization, 10:112, 1973.
4. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In C. C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 319-333. Springer, June 2008.
5. R. Geisberger and C. Vetter. Efficient routing in road networks with turn costs. In SEA'11, pages 100-111, 2011.
6. A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A*Search Meets Graph Theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pages 156-165. SIAM, 2005.
7. J. Hershberger and J. Snoeyink. An o(nlogn) implementation of the douglas-peucker algorithm for line simplification. In Proceedings of the tenth annual symposium on Computational geometry, SCG '94, pages 383-384, New York, NY, USA, 1994. ACM.
8. C. Jung, D. Karch, S. Knopp, D. Luxen, and P. Sanders. Engineering Efficient Error-Correcting Geocoding. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM Press, 2011.
9. T. Kieritz, D. Luxen, P. Sanders, and C. Vetter. Distributed Time-Dependent Contraction Hierarchies. In P. Festa, editor, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science. Springer, May 2010.
10. S. Knopp, P. Sanders, D. Schultes, F. Schulz, and D. Wagner. Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), pages 36-45. SIAM, 2007.
11. E. Köhler, R. H. Möhring, and H. Schilling. Acceleration of Shortest Path and Constrained Shortest Path Computation. In Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), volume 3503 of Lecture Notes in Computer Science, pages 126-138. Springer, 2005.
12. MoNav. http://code.google.com/p/monav/.
13. Project OSRM. http://project-osrm.org.
14. QtQuick. http://qt.nokia.com/qtquick.
15. P. Sanders, D. Schultes, and C. Vetter. Mobile Route Planning. In Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08), volume 5193 of Lecture Notes in Computer Science, pages 732-743. Springer, September 2008.