2008/7/21 Sven Anders <[EMAIL PROTECTED]>: > Has someone a working algorithm to get the shortest distance from a node to > a > way? > > You have a whole bunch of such geometrical operations at http://svn.openstreetmap.org/applications/editors/merkaartor/Utils/LineF.h
"double distance(const QPointF& P) const" does basic segment to point distance. - Chris -
_______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/dev
