[Routing] routing over areas?

[Marcus Wolschon]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Karl Newman schrieb:
| On Tue, May 13, 2008 at 12:34 PM, OJ W <ojwlists at googlemail.com> wrote:
|
|> Hi. Just wondering if any routing software yet has started to use areas?
|>
|> e.g. if one path goes into a parking lot, and another path exits from
|> the other side, does this typically get treated as routeable by
|> existing software?
|>
|
| That seems like the sort of thing that would be ideal for a
pre-processor to
| do--take a area which is supposed to be routable and create a synthetic
| routing node in the middle of the area which simply serves as a connecting
| point for all the routable ways which touch the area. It might not look
| pretty (if the route is shown driving straight across a parking lot, for
| example) but it would get the job done.

It's not as easy as that because many such areas have holes.
For example one such area is the town-square here with a big
church in the middle. You are allowed to drive there but it
is not advisable to drive through the church. ;)

I'd guess the simplest way of implementing a routing over areas
would be to ignore the fact that it is an area and use the bondary
as just another type of road.
The best way would be more like a pre-processing/online-filtering
to replace the area with a complete graph of sensible ways from
each street entering the area to each streat leaving the area
and from/to all adjecting areas that can be navigated on.

Marcus
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFIKfB1f1hPnk3Z0cQRAhghAJ9usonltd8F/V3H49kdU5vpvkWTygCgv0jY
SBHNHIoK9rCWymRm5PYPl+k=
=u5J7
-----END PGP SIGNATURE-----