On Wed, Mar 25, 2009 at 07:32:06PM +0000, Andrew M. Bishop wrote: > Peter Childs <pchi...@bcs.org> writes: > > >>>I decided that what would be fun to implement is a routing algorithm > >>>that can find the best (shortest or quickest) route between any two > >>>OSM highway nodes. I know that there are other routing algorithms > >>>available but this started as an intellectual exercise so I developed > >>>my own. It seemed to work so I added a fancy web front end to it and > >>>put it on a server. > >>> > >>>http://www.gedanken.org.uk/mapping/router/router.html > > > Neat, there seam to be a lot of good routing method appearing for OSM. > > All with interesting differences over what the commersial sources > > produce, (eg Google, Multimap, etc) Not usually wrong but different, > > > > Does anyone know of any Routing code thats Open Source. > > > > Is there any way to encourage the system to use Dual Carriage Way > > Primary Roads over Single Carriage Way Primary Roads (or in this case > > Seconday) eg eg A289 vs B2108 is Strood, Kent. > > Encouraging dual-carriageway rather than single will need some way of > detecting one rather than the other. Perhaps lanes=n (n>1) and > oneway=true would work if enough people tag them like that.
Similarly they can be identified by relation[1], again if enough people tag like that. In real life I haven’t seen much of either. :( [1]: http://wiki.openstreetmap.org/wiki/Relations/Proposed/Dual_carriageways Simon -- A complex system that works is invariably found to have evolved from a simple system that works.—John Gall
signature.asc
Description: Digital signature
_______________________________________________ Talk-GB mailing list Talk-GB@openstreetmap.org http://lists.openstreetmap.org/listinfo/talk-gb
