K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Deferred data structure for the nearest neighbor problem
Information Processing Letters
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry in C
Queries on Voronoi diagrams of moving points
Computational Geometry: Theory and Applications
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Proximity and applications in general metrics
Proximity and applications in general metrics
Comparison of various trees for nearest-point search with/without the Voronoi diagram
Information Processing Letters
Power diagrams and intersection detection
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
| Hi-index | 0.00 |
The paper presents an efficient algorithm for solving the nearest-neighbor problem in the plane, based on generalized Voronoi diagram construction. The input for the problem is the set of circular sites S with varying radii, the query point p and the metric (Minkowski or power) according to which the site neighboring the query point, is to be reported. The IDG/NNM software was developed for an experimental study of the problem. The experimental results demonstrate that the Voronoi diagram method outperforms the k - d tree method for all tested input site configurations. The similarity between the nearest-neighbor relationship in the Minkowski and power metrics was also established.