K-Nearest Neighbour Searching
M.Babai
M.Babai at rug.nl
Thu Oct 23 13:36:06 UTC 2008
Dear all,
For a multi-dimensional (6 - 11) classification problem I was searching
for a fast data structure and found this implementation on WikiPedia.
In our application we need to find K-Nearest Neighbours of a given query
point q. I have played around using the provided example program and
think I can understand the basics of how the library works. But I was
not able to perform the search such a way that only the list of the
K-Nearest neighbouring points is returned.
Anybody any suggestion how to use this library to perform K-Nearest
Neighbour Searching?
Thanks in advance,
Kind wishes,
Arya.
More information about the libkdtree-devel
mailing list