Xavier Holt edited our_kd_tree_has_k__.md  about 8 years ago

Commit id: d281266bae7f73bcbb1945dd6126161e8b4b1b26

deletions | additions      

       

* our kd-tree has \(k=4\) so this is an \(O(n^{3/4} + k)\) operation.  Preprocessing: \(O(n\log n\), Storage: \(O(n)\), Queries: \(O(n^{3/4} + k)\) \(\square\).  ##