[Routing] How to handle lack of connectivity within the routing graph?
Nic Roets
nroets at gmail.com
Wed Jun 4 00:25:03 BST 2008
On Thu, May 15, 2008 at 9:45 PM, David MENTRE <dmentre at linux-france.org> wrote:
> With such a divided map, sometimes there is no route between two points
> if those points are in two separated components.
>
> Has anybody any idea how one should handle this?
...
> * In the above case, are other routing programs (e.g. recently
> announced Gosmore) using some kind of "tricks" to join the separated
> components (e.g. consider two way points so close that they are the
> same point)?
No such "tricks".
But the latest version of gosmore will help you to find these
discontinuities. The returned route will start with a 'jump' to the
closest point for which a solution exist. I can demonstrate this with
that cool new website made by Lambertus. Go to
http://tile.openstreetmap.nl/~lambertus/routing/?flat=53.7097&flon=7.2052&tlat=53.7079&tlon=7.1558&v=motorcar&fast=0
and zoom out far enough so that you can see the start and end markers
on the Northern island of Norderney. The Eastern and Western road
network is only connected using cycleways, so the route returned for a
motorcar starts at the most Eastern point of the Western network.
Also see http://forum.openstreetmap.org/viewtopic.php?id=735
More information about the Routing
mailing list