A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
[article]
2016
arXiv
pre-print
In the Hausdorff Voronoi diagram of a family of clusters of points in the plane, the distance between a point t and a cluster P is measured as the maximum distance between t and any point in P, and the diagram is defined in a nearest-neighbor sense for the input clusters. In this paper we consider which the combinatorial complexity of the Hausdorff Voronoi diagram is linear in the total number of points, n, on the convex hulls of all clusters. We present a randomized incremental construction,
arXiv:1312.3904v3
fatcat:m7okeyqfnzcj5c4wxtpuvjremy