> There is paper that reports on speedup techniques and various > combinations: https://algo2.iti.uni-karlsruhe.de/1328.php. Page 19 lists > preprocessing and query times for various methods.
Ok, you're right. There a much better solutions. But even the worst solutions take less than a second, even simplistic ones like an A* with an improved heuristic. And we loop back to my intial point: computing the shortest path accross europe, is no big deal on a desktop computer ;) The problem remains how to define and compute a good path. _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
