A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem

Heng-Zhao Ma, Jianzhong Li. A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem. In Yingshu Li, Mihaela Cardei, Yan Huang, editors, Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings. Volume 11949 of Lecture Notes in Computer Science, pages 362-374, Springer, 2019. [doi]

@inproceedings{MaL19-19,
  title = {A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem},
  author = {Heng-Zhao Ma and Jianzhong Li},
  year = {2019},
  doi = {10.1007/978-3-030-36412-0_29},
  url = {https://doi.org/10.1007/978-3-030-36412-0_29},
  researchr = {https://researchr.org/publication/MaL19-19},
  cites = {0},
  citedby = {0},
  pages = {362-374},
  booktitle = {Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings},
  editor = {Yingshu Li and Mihaela Cardei and Yan Huang},
  volume = {11949},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-36412-0},
}