The Community for Technology Leaders
Green Image
Issue No. 06 - June (1982 vol. 31)
ISSN: 0018-9340
pp: 478-487
null Der-Tsai Lee , Department of Electrical Engineering and Computer Science, Northwestern University
The notion of Voronoi diagram for a set of N points in the Euclidean plane is generalized to the Voronoi diagram of order k and an iterative algorithm to construct the generalized diagram in 0(k2N log N) time using 0(k2(N - k)) space is presented. It is shown that the k-nearest neighbor problem and other seemingly unrelated problems can be solved efficiently with the diagram.
Voronoi diagram, Analysis of algorithm, computational complexity, divide and conquer technique, k-nearest neighbors, point location
null Der-Tsai Lee, "On k-Nearest Neighbor Voronoi Diagrams in the Plane", IEEE Transactions on Computers, vol. 31, no. , pp. 478-487, June 1982, doi:10.1109/TC.1982.1676031
93 ms
(Ver 3.3 (11022016))