On the symmetric angle-restricted nearest neighbor problem

Authors:
Alok Aggarwal;Youngcheul Wee
Affiliations:
IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY;Division of Information and Computer Engineering, Ajou University, Suwon, Republic of Korea
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 0

Approximation algorithms for shortest path motion planning

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The region approach for computing relative neighborhood graphs in the Lp metric

Computing
On the angle restricted nearest neighbor problem

Information Processing Letters
Euclidean minimum spanning trees and bichromatic closest pairs

Discrete & Computational Geometry
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

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.