find_within_range with euclidean distance

[Tom Uram]

The code in kdtree.hpp includes this comment:

      // NOTE: this will visit points based on 'Manhattan distance' aka
city-block distance
      // aka taxicab metric. Meaning it will find all points within:
      //    max(x_dist,max(y_dist,z_dist));
      //  AND NOT than what you would expect: sqrt(x_dist*x_dist +
y_dist*y_dist + z_dist*z_dist)
      //
      // This is because it converts the distance into a bounding-box
'region' and compares
      // against that.
      //
      // If you want the sqrt() behaviour, ask on the mailing list for
different options.

I could implement this, but thought I'd ask if this is a solved problem.

Thanks!
Tom
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20131213/4659a8d2/attachment.html>