Hi Thomas,<br><br>I'm glad you had such success!<br><br>Happy New Year,<br>Paul<br><br>ps why not contribute to kdtree?<br><br><br><div class="gmail_quote">On 29 December 2010 06:11, Thomas Köppe <span dir="ltr"><<a href="mailto:t.koeppe@ed.ac.uk">t.koeppe@ed.ac.uk</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Dear both,<br>
<br>
I just solved the Facebook puzzle "It's a Small World" within mere minutes by using your kD-Tree library and the<br>
n-neareast-neighbours predicate (<a href="http://lists.alioth.debian.org/pipermail/libkdtree-devel/2010-November/000354.html" target="_blank">http://lists.alioth.debian.org/pipermail/libkdtree-devel/2010-November/000354.html</a>),<br>
after having spent over a week trying to write a kNN algorithm with Delaunay triangulations. I just wanted to say a big<br>
thanks to both of you for developing this great little library, and I hope that Paul's predicate will make it into the<br>
main code soon!<br>
<br>
All the best, and happy new year,<br>
<font color="#888888"><br>
Thomas<br>
</font></blockquote></div><br>