About

A k-d tree is a spatial partitioning data structure used to organize points in k-dimensional space.

k-d trees are a specialized form of binary space partitioning. They are useful for performing searches that involve multi-dimensional keys (finding points near another point, finding points in a range).

history | excerpt history