An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Efficient routing in road networks with turn costs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Engineering efficient error-correcting geocoding
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Distributed time-dependent contraction hierarchies
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
EcoMark: evaluating models of vehicular environmental impact
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Energy-optimal routes for electric vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Towards a Flexible and Scalable Fleet Management Service
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Multi-day and multi-stay travel planning using geo-tagged photos
Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
Flexible route guidance through turn instruction graphs
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
| Hi-index | 0.00 |
Routing services on the web and on hand-held devices have become ubiquitous in the past couple of years. Websites like Bing or Google Maps allow users to find routes between arbitrary locations comfortably in no time. Likewise onboard navigation units belong to the off-the-shelf equipment of virtually any new car. The amount of volunteered spatial data of the OpenStreetMap project has increased rapidly in the past five years. In many areas, the data quality already matches that of commercial map data, if not outright surpass it. We demonstrate both a server and a hand-held device based implementation working with OpenStreetMap data. Both applications provide real-time and exact shortest path computation on continental sized networks with millions of street segments. We also demonstrate sophisticated real-time features like draggable routes and round-trip planning.