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.ezproxy.canberra.edu.au/doi/pdf/10.1145/355744.355745)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1975

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/355744.355745

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=K-d_Tree_(Nearest_Neighbor_Search_(NNS)_Nearest_Neighbor_Search)&oldid=46942"