Vindictive Voronoi Games and Stabbing Delaunay Circles

In this paper we consider the following problem: Given a set of n Playerl sites in the plane and their Delaunay triangulation D, place minimum possible Player2 sites such that in the resulting Delaunay triangulation D´ of the sites of both Players, the neighborship between Playerl sites are as less as possible. We first consider placing minimum number of Player2 sites such that no two Playerl sites are neighbors in D´. We show that to isolate a Playerl site p, two Player2 sites are both necessary and sufficient if p is in the convex hull of D, otherwise three Player2 sites are both necessary and sufficient. This gives a liner time algorithm to individually isolate all Playerl sites by 3n-h Player2 sites, where h is the number of sites in the convex hull of D. Then we give two more algorithms for this problem. The next algorithm runs also in linear time and uses 3(n-1)-h Player2 sites, but is much simpler. Our next algorithm uses 5M sites, where |M| is the size of a maximum matching in D, and runs in O(√(nm)) time, where m is the number of edges of D. Then we consider isolating sites by components, where a component in D is a maximal connected subset of sites of the same player. We show that it is possible to place n Player2 sites such that in D´ the number of components among Playerl sites is higher than that among Player2 sites. The above problems are related to at least two existing well known research topics: Voronoi games, where the strategy of each of the two players is to place sites such that in the resulting Voronoi diagram some certain criteria is optimized for each player, and proximity graphs, where this problem is known as minimum stabbing set of Delaunay circles. Our bound of 5|M| for the first problem would work better than known bound for the minimum stabbing set of Delaunay circles if M has a smaller size.