implements about space partitioning wiki.
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. wiki
There are still some problems to be solved below.
- How to blance a kd_tree ?
- How to expand to N dimension ?