Skip to main content
Source Link
user1430
user1430

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).