Nearest-neighbor searching under uncertainty II
Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of
points, is an important and widely studied problem in many fields, and it has a wide range of …
points, is an important and widely studied problem in many fields, and it has a wide range of …
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, S Langerman… - Latin American …, 2014 - Springer
Abstract In the Hausdorff Voronoi diagram of a set of point-clusters in the plane, the distance
between a point t and a cluster P is measured as the maximum distance between t and any …
between a point t and a cluster P is measured as the maximum distance between t and any …