Open tinsir888 opened 7 months ago
https://tinsir888.github.io/posts/955dd42e.html
Kd-Trees Problem set given a set PPP of nnn points in R2\mathbb R^2R2 store PPP in a data structure s.t. given a query rectangle RRR, we can find the points in RRR efficiently. idea generalize BST
https://tinsir888.github.io/posts/955dd42e.html
Kd-Trees Problem set given a set PPP of nnn points in R2\mathbb R^2R2 store PPP in a data structure s.t. given a query rectangle RRR, we can find the points in RRR efficiently. idea generalize BST