On 23 Mar 2009, at 19:14, Andrew M. Bishop wrote: > [email protected] (Andrew M. Bishop) 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. > >> The router itself (requires JavaScript for the map etc): >> >> http://www.gedanken.org.uk/mapping/router/router.html > > > On a topic related to the other ongoing discussion about tagging > footway and cycleway it is obviously important for a router that > things are tagged consistently. > > The router is currently mapping highway=path to be identical to > highway=footway so that foot=yes is implied. This will cause a > problem with the router if the path is also bicycle=designated. When > you run the router with bicycle as your mode of transport and disable > using footways (which is the default state for bicycles) then it won't > take the path.
Obviously the tagging is too complex. My definition of a highway=path is a worn line in some grass. If it is something that is maintained for cyclists then it is a highway=cycleway, with an option foot=yes, cycleway=shared or cycleway=segregated. This is the reason why you need as few tags as possible to tag something, rather than having a lot of modifier tags. Shaun _______________________________________________ Talk-GB mailing list [email protected] http://lists.openstreetmap.org/listinfo/talk-gb
