Philip Homburg wrote: > You may try a third or fourth node as well, depending on a cut off > distance (how sparse is the higher level graph) or on how optimal the > result has to be Would it help if a certain level of 'sparseness' could be guaranteed for every layer (i.e. a minimum distance between nodes) to guarantee an optimal solution after examining some n closest nodes of the next higher level? > > For intermediate levels, you can pre-compute routes from nodes in the > intermediate level to a number of nodes the next higher level. > It would certainly speed up to pre-compute all (necessary) 'connection-nodes' to the next higher layer. In case of a city every major junction would have pointers (with associated cost) to every motorway-link that is reached at fastest solely via the secondary layer network. Do you think like that? Would it be storage space overkill to do that?
_______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
