I am trying to find a way to calculate the shortest path from one point to another without crossing the boundaries of a polygon. I would like to do it with QGIS as I do not have access to ArcGis.
It thought of a solution using network tools: 1) Fill the polygon with a given number of points 2) Generate all the possible links (figured as line vectors) between every pair of points 3) Suppress all the links that intersect my polygon boundaries 4) Use GRASS to calculate the shortest path between two given points
My problem is that I do not find a way to manage the 2nd step.
I found the "Flow Mapper plugin" in QGIS, but I really can't figure out how I am suppose to use it.
Any help would be more than welcome! :) Thanks a lot