[OSM-talk] routing across open spaces

[Anthony]

On Tue, Nov 30, 2010 at 6:08 PM, Anthony <osm at inbox.org> wrote:
> Just take the n ways which connect to the area, and
> run http://www.loria.fr/~lazard/Publications/Curvature-constrained_shortest_path_in_a_convex_polygon/Curvature-constrained_shortest_path_in_a_convex_polygon.html

Actually, that was a more difficult problem.  This simpler one would
also work: http://alienryderflex.com/shortest_path/