[OSM-talk] Routing algorithms and areas

[Iván Sánchez Ortega]

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

Hi there,


I'm having some doubts about the current route-planning algorithms, and about 
how do they deal with areas.

For example, I might want to park my car in a parking, and then switch to a 
footpath leading to my destination (e.g. a building).
Another example: I'm walking, and the optimal route crosses a square (or 
plaza), or a park (which I can walk out of the designed footpaths).

Problem is, the road leading to the parking is not connected to the footpath, 
so they do not make a network "per se".

So, routing algorithm boys: how do you plan to deal with this kind of stuff?

Cheers,
- -- 
- ----------------------------------
Iván Sánchez Ortega <ivansanchez at escomposlinux.org>

Me opongo a las relaciones sexuales antes de la boda, por el peligro de
llegar tarde a la ceremonia.
		-- Antonio Ricci. 
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)

iD8DBQFGnJlwR56dWuhgxGgRAqAaAJ4n/I4Wwb2rXoJHVV4q5eL4uiY1ywCdHYZJ
FJHtl2lzJOgsCid7O1og3Qo=
=5yar
-----END PGP SIGNATURE-----