Skip to main content
Conference Proceedings

A sweep algorithm for the all-nearest-neighbors problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 333 LNCS 43-54
DOI: 10.1007/3-540-50335-8_23
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The 2-dimensional all-nearest-neighbors problem is solved directly in asymptotically optimal time O(n*log n) using a simple plane-sweep algorithm. We present the algorithm, its analysis, and a "foolproof" implementation which guarantees an exact result at the cost of using five-fold-precision rational arithmetic.

Author supplied keywords

Cite

CITATION STYLE

APA

Hinrichs, K., Nievergelt, J., & Schorn, P. (1988). A sweep algorithm for the all-nearest-neighbors problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 333 LNCS, pp. 43–54). Springer Verlag. https://doi.org/10.1007/3-540-50335-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free