search

jtsiomb / kdtree

A simple C library for working with KD-Trees
http://nuclear.mutantstargoat.com/sw/kdtree/
Other
391 stars 115 forks source link

find_nearest function #20

Open bobobe opened 6 years ago

bobobe commented 6 years ago

i find that something wrong with find_nearest method,One of the reasons why kdtree saves time is to use the distance from the nearest point to the point to be queried as the radius. If there is no intersection with the hyperplane, you do not need to go to the sibling nodes again. However, this method does not have this crucial step。