KDTree

A KDTree (k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. K DTrees are useful for applications that involve multidimensional search keys, such as range searches and nearest neighbor searches.
For more information, you can visit the Wikipedia page on KDTrees.

The running example can be found in the repository

For details see query and `` and try_sskd_tree, try_kd_tree methods.