Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
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
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
György E. Révész
Theoretical Computer Science
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine