[Routing] [OSM-dev] pre-compute routing

[Stefan de Konink]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA512

Steve Coast schreef:
> Let us assign B to be the the number of bytes per way id. B=2, 16 
> bits can currently encode all ways.

Why would you like to store an entire table, instead of partial tables
and heuristics? The last one is much more efficient in rerouting when
ways are added.

Brandon schreef:
> It's important to note that you don't actually need to compute or
> store N^2 routes. If you take the shortest-path-tree of a node, and
> then take the shortest-path-tree of a nearby node, and take the
> intersection of the two SPTs, you'll find that there's a great deal
> of overlap between the two that you don't need to compute twice.
> You'll note this is how our brains figure out routing.

Second that.


Stefan

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.7 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFG+9i8YH1+F2Rqwn0RCtneAJ9E8tCDau8aTu5hFBQ/IagWhrbwOgCgiGh1
dTRxYJhaWLCAC0HYEGBCk74=
=5yP/
-----END PGP SIGNATURE-----