Maximizing a Voronoi Region: The Convex Case

Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the Voronoi diagram of S and p? We study the case where the Voronoi neighbors of p are in convex position, and prove that there is at most one local maximum.

[1]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[2]  Otfried Cheong,et al.  Competitive Facility Location along a Highway , 2001, COCOON.

[3]  Jirí Matousek,et al.  The one-round Voronoi game , 2002, SCG '02.

[4]  Bruce R. Piper.  Properties of Local Coordinates Based on Dirichlet Tesselations , 1993, Geometric Modelling.

[5]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[6]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[7]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[8]  Atsuyuki Okabe,et al.  Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space , 1991 .