K Nearest Neighbour Search

Uses a kd-tree to find the p number of near neighbours for each point in an input/output dataset.