Timeline for What algorithms compute directions from point A to point B on a map?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:33 | history | edited | URL Rewriter Bot |
replaced http://gis.stackexchange.com/ with https://gis.stackexchange.com/
|
|
| Aug 14, 2015 at 18:50 | comment | added | Paul Chernoch | Bidirectional Dijkstra using Landmarks to perform goal-directed search is more efficient than Bidirectional Dijkstra alone. See www14.informatik.tu-muenchen.de/lehre/2010SS/sarntal/… However this paper is not detailed enough to compute the potential function, which is a little tricky, or choose the landmarks. | |
| Sep 3, 2014 at 18:45 | history | answered | Karussell | CC BY-SA 3.0 |