find_kth_nearest

Renaud Detry renaudjdetry at airpost.net
Thu Oct 18 15:53:21 UTC 2007


Hi all,

I'd like to have you opinion on the implementation effort and
performance of a `find_pth_nearest' method (pth-nearest, k being the
number of dimensions of the tree..). Would it be hard to adapt
_M_find_nearest to offer this functionality? Does it simply amount to
keeping a p-node history in each recursion?

Thanks,
Renaud.




More information about the libkdtree-devel mailing list