Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the angle restricted nearest neighbor problem
Information Processing Letters
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Hi-index | 0.89 |
We present an O(nlogn) 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 L"p metric, 1==1.