"jceddy" <jce### [at] gmailcom> wrote:
> > Either there is a bug in my kd-tree implementation, ...
> ... using the nearest-vertex test, and then
> added some code to find the nearest vertex by using a brute-force check of *all*
thinking, re "nearest neighbour", perhaps the implementation that comes with the
GTS library "tools" may be of use? written by Sunil Arya & David Mount, "ANN:
Approximate Nearest Neighbours" (though they spell it without the 'u' :-)), I
have a version from May 2005 installed; sorry, no ref link.
Post a reply to this message