The Farthest Color Voronoi Diagram in the Plane

The farthest-color Voronoi diagram (FCVD) is defined on a set of n points in the plane, where each point is labeled with one of m colors. The colored points constitute a family $P$ of m clusters (sets) of points in the plane whose farthest-site Voronoi diagram is the FCVD. The diagram finds applications in problems related to facility location, shape matching, data imprecision, and others. In this paper we present structural properties of the FCVD, refine its combinatorial complexity bounds, and present efficient algorithms for its construction. We show that the complexity of the diagram is $O\left(n\alpha \right(m)+\mathrm{str}(P\left)\right)$ , where $\mathrm{str}\left(P\right)$ is a parameter reflecting the number of straddles between pairs of clusters, which is $O\left(m\right(n-m\left)\right)$ . The bound reduces to $O(n+\mathrm{str}(P\left)\right)$ if the clusters are pairwise non-crossing. We also present a lower bound, establishing that the complexity of the FCVD can be $\Omega (n+m^2)$ , even if the clusters have pairwise disjoint convex hulls. Our algorithm runs in $O\left((n+\mathrm{str}\left(P\right)){log}^{3}n\right)$ -time, and in certain special cases in $O(nlogn)$ time.