On Tue, 26 May 2009 14:58:42 +0200, Benoît TRICOIRE <[email protected]> wrote: > Hi Markus, > > Hello, > > I am working on a routing-engine designed for large distance table > computing. I am facing the following problem: > > I have a graphe that represents a road network and additionals informations > that concern turn restrictions. > My routing-engine cannot deal with restriction. So I would like to turns > nodes with turn-restrictions into a new graph structure. I saw here > http://lists.openstreetmap.org/pipermail/osmosis-dev/2009-February/000121.html > that you implemented such a solution. Did you have a paper or a link that > describes the algorithm?
I guess you could get better answers if you tried the routing -list instead of the osmosis-dev -list. No paper but a well commented and working implementation: http://apps.sourceforge.net/mediawiki/travelingsales/index.php?title=Plugin/TurnRestrictedMultiTargetDijkstraRouter Marcus _______________________________________________ osmosis-dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/osmosis-dev
