Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper
is to calculate the minimum value of the red sites’ weight such that the union of the red Voronoi cells in the weighted Voronoi diagram of S is a connected region. This problem is solved for the multiplicativelyweighted
Voronoi diagram in O((n+m)2 log(nm)) time and for both the additively-weighted and power Voronoi diagram in O(nmlog(nm)) time
Abellanas, M. [et al.]. Connecting Red Cells in a Bicolour Voronoi Diagram. "Lecture notes in computer science", Novembre 2012, núm. LNCS 7579, p. 210-219.