Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Paper
On the symmetric angle-restricted nearest neighbor problem
Abstract
We present an O(n log n) time divide-and-conquer algorithm for solving the symmetric angle-restricted nearest neighbor (SARNN) problem for a set of n points in the plane under any Lp metric, 1 ≤ p ≤ ∞. This algorithm is asymptotically optimal (within a multiplicative constant) for any constant p ≥ 1. © 2004 Published by Elsevier B.V.
Related
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research