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 <[email protected]> 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 > [email protected] > http://lists.openstreetmap.org/listinfo/routing > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
