/NearestNeighbour

This is a solution to the Nearest Neighbour problem using a K-D Tree that finds the nearest m points to a specific point in a set of points in O(lgn) time.

Primary LanguagePython

Nearest Neighbour Finder

This is an implementation of nearest m-neighbours finidng using a KD-Tree and a Bucketed KD-Tree.

N|Solid