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, an optimization based on the concept of a clipped computation, and describe two robust realizations: a "foolproof" implementation which guarantees an exact result at the cost of using five-fold-precision rational arithmetic, and a robust floating point version.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. B. Beretta: An implementation of a plane-sweep algorithm on a personal computer, Ph. D. Thesis Nr. 7538, ETH Zurich, 1984.
S. Fortune: A Sweepline Algorithm for Voronoi Diagrams, Proc. 2nd Ann. Symp. on Computational Geometry, ACM, 313–322, 1986.
M. Shamos, D. Hoey: Closest-Point Problems, 16th Annual IEEE Symposium on Foundations of Computer Science, 151–162 (1975).
M. Shamos, D. Hoey: Geometric intersection problems, 17th Annual IEEE Symposium on Foundations of Computer Science, 208–215 (1976).
P. Vaidya: An Optimal Algorithm for the All-Nearest-Neighbors Problem, Proc. 27th IEEE Symp. Foundations of Computer Science, 117–122, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hinrichs, K., Nievergelt, J., Schorn, P. (1989). A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_62
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive