Hello, "Harald Kleiner" <[EMAIL PROTECTED]> writes:
> A few words about my method: > * Find end-nodes of ways that are not connected to any other way and check > for each of them: > * find ways that have at least one node inside the 3x3 matrix of tiles > surrounding the node-under-test > * calculate the min. distance from the node-under-test to any segment of > these ways > * if the min. distance is less than a given limit, an error is found (the > node lies almost on a segment) What is the value of the limit? Sincerely yours, d. -- GPG/PGP key: A3AD7A2A David MENTRE <[EMAIL PROTECTED]> 5996 CC46 4612 9CA4 3562 D7AC 6C67 9E96 A3AD 7A2A _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/dev
