A few weeks ago I wrote:
> I have been a contributor to OpenStreetMap for a while now and
> recently decided to make use of some of the collected data rather than
> just adding to it.
>
> I decided that what would be fun to implement is a routing algorithm
> that can find the best (shortest or qui
Shaun McDonald wrote:
> On 23 Mar 2009, at 19:14, Andrew M. Bishop wrote:
>
>> a...@gedanken.demon.co.uk (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 no
> 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.
Oneway=yes these days , but otherwise I liked this idea so much I
recorded waypoints each time t
On Wed, Mar 25, 2009 at 07:32:06PM +, Andrew M. Bishop wrote:
> Peter Childs 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
"Bob Hawkins" writes:
> Using the link http://www.gedanken.org.uk/mapping/router/router.html in IE
> 7, although the details to the left of the map frame are present, I see an
> empty area - no map. Should I be able to?
Yes, the map should appear on the right in a frame with a thicker
borde
Using the link http://www.gedanken.org.uk/mapping/router/router.html in IE
7, although the details to the left of the map frame are present, I see an
empty area - no map. Should I be able to?
___
Talk-GB mailing list
Talk-GB@openstreetmap.org
http:
Peter Childs 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 d
Peter Miller writes:
>> Would you consider the GPL licence?
>>
>> Name ideas:
>>
>> "Tora"- The Open Routing Algorithm?
>>
>> "Aora"- Andrew's..
>>
>> What's it written in, maybe that could help with the namePyOra,
>> for example?
> A name... Who is this project aimed at? You need to a
On 23 Mar 2009, at 19:14, Andrew M. Bishop wrote:
> a...@gedanken.demon.co.uk (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 ot
On 23 Mar 2009, at 19:31, Chris Andrew wrote:
> Andrew,
>
> Would you consider the GPL licence?
>
> Name ideas:
>
> "Tora"- The Open Routing Algorithm?
>
> "Aora"- Andrew's..
>
> What's it written in, maybe that could help with the namePyOra,
> for example?
>
> Just a thought.
A name..
On Mon, Mar 23, 2009 at 07:31:46PM +, Chris Andrew wrote:
> Andrew,
>
> Would you consider the GPL licence?
>
> Name ideas:
>
> "Tora"- The Open Routing Algorithm?
Already used for the Toolkit for Oracle[1].
[1]: http://tora.sourceforge.net/
Simon
--
A complex system that works is invari
On Mon, Mar 23, 2009 at 07:02:17PM +, Andrew M. Bishop wrote:
> > This is really neat. it's good to see a few excellent routers occuring
> > because of OSM.
> > I think your one is quite powerful for the ability to customise the
> > weighting, nice!
> >
> > Also, any plans to release the source
Andrew,
Would you consider the GPL licence?
Name ideas:
"Tora"- The Open Routing Algorithm?
"Aora"- Andrew's..
What's it written in, maybe that could help with the namePyOra, for example?
Just a thought.
Chris.
2009/3/23 Andrew M. Bishop :
> "Tim Waters (chippy)" writes:
>
>>> I de
a...@gedanken.demon.co.uk (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
"Tim Waters (chippy)" 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 exerci
On Mon, Mar 23, 2009 at 12:56 PM, Peter Childs wrote:
> Does anyone know of any Routing code thats Open Source.
here are a few which work with OSM data. there may be (many) more out
there on the internet :-)
http://wiki.openstreetmap.org/wiki/Gosmore
http://wiki.openstreetmap.org/wiki/Traveling_
9 10:23 PM
>>To: talk-gb@openstreetmap.org
>>Subject: [Talk-GB] Route planner using UK OSM data
>>
>>I have been a contributor to OpenStreetMap for a while now and
>>recently decided to make use of some of the collected data rather than
>>just adding to it.
>>
&g
Nice work :-)
Cheers
Andy
>-Original Message-
>From: talk-gb-boun...@openstreetmap.org [mailto:talk-gb-
>boun...@openstreetmap.org] On Behalf Of Andrew M. Bishop
>Sent: 22 March 2009 10:23 PM
>To: talk-gb@openstreetmap.org
>Subject: [Talk-GB] Route planner using UK
Hi Andrew,
This is really neat. it's good to see a few excellent routers occuring
because of OSM.
I think your one is quite powerful for the ability to customise the
weighting, nice!
Also, any plans to release the source for the router available so we
can play too?
Tim
2009/3/22 Andrew M. Bisho
I have been a contributor to OpenStreetMap for a while now and
recently decided to make use of some of the collected data rather than
just adding to it.
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 high
20 matches
Mail list logo
