K-d tree: Difference between revisions

Content added Content deleted
(bugfix: need to test distance from point to dividing plane to decide if checking other side is relevant)
Line 964:
 
On the bigger dataset, the kdtree implementation is about the same speed as the brute force implementation.
 
For a more practical approach to this kind of problem, see https://github.com/locklin/j-nearest-neighbor (that is: link to a high performance implementation).
 
See also: [[wp:KISS_principle]]