About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
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.