Abstract
We present a simple, efficient, robust plane-sweep algorithm that solves 2-dimensional nearest-neighbor problems in asymptotically optimal timeO(n logn). A “foolproof” implementation guarantees an exact result at the cost of using triple-precision integer arithmetic at some key steps.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[Fo 87] Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica2, 153–174 (1987)
[HNS 89] Hinrichs, K., Nievergelt, J., Schorn, P.: A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited 14-th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), Amsterdam., In: Leeuven, J. van (ed.) Graph-theoretic concepts in computer science (Lect. Notes Comput. Sci., Vol. 344, pp. 442–457) Berlin Heidelberg New York: Springer 1989
[Mi 89] Milenkovic, V.: Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic. 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 500–505
[Sch 91] Schorn, P.: Robust algorithms in, a program library for geometric computation. PhD Dissertation No. 9519, ETH Zurich, Switzerland, 1991
[SH 75] Shamos, M., Hoey, D.: Closest-point problems. 16th Annual IEEE Symposium on Foundations of Computer Science, 1975, pp. 151–162
[Va 89] Vaidya, P.: AO(n logn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom.4, 101–115 (1989)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hinrichs, K., Nievergelt, J. & Schorn, P. An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. Acta Informatica 29, 383–394 (1992). https://doi.org/10.1007/BF01178779
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178779