In this paper we examined an algorithm for the All-k-Nearest-Neighbor problem proposed in 1980s, which was claimed to have an upper bound on the running time. We find the algorithm actually exceeds the so claimed upper bound, and prove that it has an lower bound on the time complexity. Besides, we propose a new algorithm that truly achieves the bound. Detailed and rigorous theoretical proofs are provided to show the proposed algorithm runs exactly in time.
CITATION STYLE
Ma, H., & Li, J. (2019). A True O(n log n) algorithm for the all-k-nearest-neighbors problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11949 LNCS, pp. 362–374). Springer. https://doi.org/10.1007/978-3-030-36412-0_29
Mendeley helps you to discover research relevant for your work.