Adds a new point to the kd tree.
Creates a slice of all elements in the kd tree.
Finds the neares neighbor in the kd tree using euclidean distance metric. root must not be empty.
Rebalances the kd tree by creating a new tree with the same elements
Counts the number of elements in the kd tree.
Creates a new kd tree.
This module is based on https://github.com/Mihail-K/kdtree.