Abstract
This paper presents an algorithm, that constructs all Voronoi diagrams for k nearest neighbor searching in the Euclidean plane simultaneously. Its space and time complexity of O(N4) is shown to be optimal.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kirkpatrick: Optimal Search in Planar Subdivisions, Department of Computer Science, Univ. of British Columbia, Vancouver, B.C., Canada, Report 81-13, 1981
Lee: An Approach to Finding the K-Nearest Neighbor in the Euclidean Plane, Department of Electrical Engineering and Computer Science, Northwestern Univ., Evanston, II. 60201, USA, Report 1981
Maurer: The Post-Office Problem and Related Questions, in Noltemeier (ed.): Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG80, Bad Honnef, June 1980, Lecture Notes in Computer Science 100, Springer 1981
Shamos: Computational Geometry, Yale University, New Haven, Connecticut,USA, Ph.D.Thesis, 1975
Shamos: Geometric Complexity, Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975, pp.224–233
Shamos,Hoey: Closest-Point Problems, Proceedings of the 16th IEEE Symposium on Foundations of Computer Science, 1975, pp.151–162
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dehne, F. (1983). An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036906
Download citation
DOI: https://doi.org/10.1007/BFb0036906
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive