Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions

DOI10.1137/1.9781611975994.173OpenAlexW3004252175MaRDI QIDQ5146970

Chih-Hung Liu

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.02066

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Minimum cuts in geometric intersection graphs ⋮ Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions

This page was built for publication: Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions