K-d Tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

k-d Tree construction: $O(n \log n)$ NNS: $O(n)$

Space Complexity

$O(n)$

(https://dl.acm.org/doi/pdf/10.1145/355744.355745)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1975

Reference

https://dl.acm.org/doi/pdf/10.1145/355744.355745