<div class="gmail_quote"><br>Hi Sylvian,<br>Thanks a lot for your response.<br><div class="Ih2E3d"><br>> This is the typical use case of the library. And it is illustrated in<br>> the file test_kdtree.cpp:<br>> ~/libkdtree_0.6.2/exemples/test_kdtree.cpp
<br>> The function that find the nearest point to a definite point is<br>> rightfully named find_nearest().<br><br></div>I think I have understood the example, I was not so hard as I<br>though ;). I have begun to made some modification on this example
<br>for my own stuff.<br><div class="Ih2E3d"><br>> I recommend you register on the mailing list, and lookout for the next<br><br></div>Am I not registered yet?. I though I did it before send my first message,<br>let me double check.
<br><div class="Ih2E3d"><br>> update (probably during the week end). find_nearest() is undergoing a<br>> massive overhaul resulting in good performance improvements, and<br>> results of highest quality. (The current algorithm sometime fails to
<br>> find the real nearest points).<br><br></div>Very good. Actually the points I got are not exactly in the circle I've<br>defined. I have attached the modified program and the file containing<br>a test set of points. The program output two files:
<br>"bruteforce.dat", the points inside a circle using "Brute Force", and<br>"nearest.dat" using your nice algorithms. They differ in some points.<br>My guess is that the function: find_within_range() computes a rectangle,
<br>but not a circle, am I right?.<br><br>Regards,<br><div><div></div><div class="Wj3C7c"><br>--<br>Luis M. de la Cruz S. Ph-8D<br></div></div></div><br><br>