Fast KD-Tree (a recursive Implementation with fallback to linear search in case of a small number of points) in 2 or 3 dimensions.
Fast KD-Tree (a recursive Implementation with fallback to linear search in case of a small number of points) in 2 or 3 dimensions.
MIT License