The discrete voronoi game in a simple polygon
Let P be a simple polygon with m vertices and let be a set of n points in P. We consider the points of to be users. We consider a game with two players and. In this game, places a point facility inside P, after which places another point facility inside P. We say that a user is served by its nearest facility, where distances are measured by the geodesic distance in P. The objective of each player is to maximize the number of users they serve. We show that for any given placement of a facility by, an optimal placement for can be computed in O(m + n(logn + logm)) time. We also provide a polynomial-time algorithm for computing an optimal placement for.
Banik, A. (Aritra), Das, S. (Sandip), Maheshwari, A, & Smid, M. (2013). The discrete voronoi game in a simple polygon. doi:10.1007/978-3-642-38768-5_19