(So why didn't Stefan say that in the first place ...) The turn restriction problem is easy to solve once you realize that OSM nodes need not correspond to graph vertexes. The graph vertexes are states (search google for state machine).
Let's say node N1 is part of one simple turn restriction relation W1,N1,W2 and one complicated turn restriction relation W3,N2,W4,N1,W5. Then we would associate 3 states with N1 : N1a : N1 was reached after traveling along W1. N1b : N1 was reached after traveling along W3, then N2, then W4. N1c : N1 was reached in some other way. And N2 will have at least 2 states associated with it. On Sun, Sep 21, 2008 at 6:45 PM, Marcus Wolschon <[EMAIL PROTECTED]>wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Anton Patrushev schrieb: > > Hi Stefan, > > > > Sorry, no description so far. > > What do you want to use it for? > To implement routing with turn-restrictions > of cause. Using pgRouting is no option for me > as it's native code. > > Marcus > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v1.4.6 (GNU/Linux) > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org > > iD8DBQFI1noSf1hPnk3Z0cQRAuDtAKDSOndEH80Lr2g573dgn1dgfebvogCfYiEq > UHNqjtuYsYyq6yjKkGfrjnw= > =MSJC > -----END PGP SIGNATURE----- > > > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing >
_______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
