[Routing] indoor outdoor routing

[Nic Roets]

Christian,

I can find no reference to polygons or areas on that wiki page.

And when I mapped one of the largest shopping malls in the Southern
Hemisphere, I choose pedestrian ways over areas. Although pedestrians
can reduce their journeys with a few meter by heading straight for the
next entrance / exit, they rarely do.
http://osmu.org/demo/index.html?lat=-29.72654&lon=31.06684&zoom=17&layers=B000FTFTTT&v=foot&adj=recommended&markers=%21-29.72524%2C31.06776%21-29.7296%2C31.06685

So the major obstacles with indoor routing is not find a good routing
algorithm. It is
1. Locating the user with a high accuracy (e.g. Wifi beacons)
2. Identifying the most appropriate way (e.g. the destination is on
layer 1, so the router must find a way on layer 1).
3. Having a user friendly mobile interface that can tell the user to
go up or down by one layer.
4. Providing the OSM community with decent tools.

Here is a good example. You drive to the airport and park at ground
level. You want to go to the post office, also on ground level. The
correct route is to go up one level, cross the road using the bridge
and go down one level.
http://www.openstreetmap.org/?lat=-26.13410&lon=28.23123&zoom=18

On Tue, May 3, 2011 at 5:13 PM, Christian Vetter <veaac.fdirct at gmail.com> wrote:
> Hi,
>
> Routing on polygons is quite a different beast than using a simple
> graph ( e.g. street network ). I am currently not aware of FOSS
> routing engines offering this functionality.
>
> What you could try would be building a normal graph out of your set of polygons:
>  1. Break down you polygons into convex ones
>  2. Connect each corner with every other corner that is visible (
> setting the correct edge weight )
>  3. Your routing graph consists of all corners and the edges between them
> Routing in such a graph would work like this:
>  1. Find all corners visible from the start
>  2. Find all corners visible from the end
>  3. Find a route between these corners ( initialize them with the
> correct distance ). This step can be performed by traditional routing
> engines.
>
> To avoid suggesting routes that get to close to corners you should
> extrude the borders into the available space. You can also insert
> nodes and edges for elevators and stair cases.
>
> However, depending on the geometry of the places you want to route in
> your routing graph could grow quite large or you could end up with a
> dense routing graph.
>
> Regards,
>
> Christian Vetter
>
> On Tue, May 3, 2011 at 5:00 PM, Audrey Colbrant
> <audrey.colbrant at inria.fr> wrote:
>> Hi,
>>
>> I am looking for a routing engine working for indoor/outdoor routing [1]. If there's not, I would try to adapt one.
>> Any advice is welcomed  :)
>>
>> Regards,
>> Audrey
>>
>> [1] http://wiki.openstreetmap.org/wiki/Indoor_Mapping
>>
>>
>> _______________________________________________
>> Routing mailing list
>> Routing at openstreetmap.org
>> http://lists.openstreetmap.org/listinfo/routing
>>
>
> _______________________________________________
> Routing mailing list
> Routing at openstreetmap.org
> http://lists.openstreetmap.org/listinfo/routing
>