A k-d tree divides a k-dimensional space relative to the points it
contains by storing them in a binary tree, discriminating by a
different dimension at each level of the tree.
KDTree() -
Constructor for class com.savarese.spatial.KDTree
A RangeSearchTree is a spatial data structure that supports the
retrieval of data associated with point keys as well as the
searching of data that occurs within a specified range of points.