Before the code was structured to represent a Fast Multipole tree
setup, now we will try to create a kd-tree. Moreover, to implement
a nearest neighbour (NN) search and a n-NN search perhaps as well.