Has someone a working algorithm to get the shortest distance from a node to a way?
I try to explain it a Given a way between to nodes lat1,lon1 -------------> lat2,lon2 and a node latN,lonN. Wanted: the length of the linear distance between the way and the node (latN,lonN). Best Regards Sven _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/dev
