Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
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
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006