Hi Mr Mailinglist, is this a real email address?<br><br>Look in the examples folder, there is a test_kdtree_nth.cpp file, that should give you a head start.<br>If you can't find the file, check the git repository.<br><br>
thanks<br>Paul<br><br><br><div class="gmail_quote">On 11 November 2010 17:24, <span dir="ltr"><<a href="mailto:mailinglist@kroegerissendorf.de" target="_blank">mailinglist@kroegerissendorf.de</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;">Hi,<br>
is there a way to find more than the nearest neighbour of a node in kdtree?<br>
I would like to find N neighbours (e.g. 5), which are the nearest neighbours to a given point.<br>
Can anyone help me?<br>
<br>
_______________________________________________<br>
libkdtree-devel mailing list<br>
<a href="mailto:libkdtree-devel@lists.alioth.debian.org" target="_blank">libkdtree-devel@lists.alioth.debian.org</a><br>
<a href="http://lists.alioth.debian.org/mailman/listinfo/libkdtree-devel" target="_blank">http://lists.alioth.debian.org/mailman/listinfo/libkdtree-devel</a><br>
</blockquote></div><br>