The discrete voronoi game in a simple polygon

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Banik, A., Das, S., Maheshwari, A., & Smid, M. (2013). The discrete voronoi game in a simple polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 197–207). https://doi.org/10.1007/978-3-642-38768-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free