Abstract
Let P be a simple polygon with m vertices and let \(\mathcal{U}\) be a set of n points in P. We consider the points of \(\mathcal{U}\) to be “users”. We consider a game with two players \(\mathcal{P}_1\) and \(\mathcal{P}_2\). In this game, \(\mathcal{P}_1\) places a point facility inside P, after which \(\mathcal{P}_2\) places another point facility inside P. We say that a user \(u \in \mathcal{U}\) 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 \(\mathcal{P}_1\), an optimal placement for \(\mathcal{P}_2\) can be computed in O(m + n(logn + logm)) time. We also provide a polynomial-time algorithm for computing an optimal placement for \(\mathcal{P}_1\).
Research supported by NSERC and DFAIT Commonwealth Scholarship.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3), 457–467 (2004)
Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi game on graphs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 77–88. Springer, Heidelberg (2013)
Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. Journal of Combinatorial Optimization, 1–15 (2012)
Bhattacharya, B.B., Nandy, S.C.: New variations of the maximum coverage facility location problem. European Journal of Operational Research 224(3), 477–485 (2013)
Cabello, S., Díaz-Báñez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research 202(1), 99–106 (2010)
Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126–152 (1989)
Hakimi, S.L.: On locating new facilities in a competitive environment. European Journal of Operational Research 12(1), 29–35 (1983)
Kiyomi, M., Saitoh, T., Uehara, R.: Voronoi game on a path. IEICE Transactions 94-D(6), 1185–1189 (2011)
Teramoto, S., Demaine, E.D., Uehara, R.: The Voronoi game on graphs and its complexity. J. Graph Algorithms Appl. 15(4), 485–501 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banik, A., Das, S., Maheshwari, A., Smid, M. (2013). The Discrete Voronoi Game in a Simple Polygon. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)