The discrete Voronoi game in \(\mathbb{R}^2\)
From MaRDI portal
Publication:1616243
DOI10.1016/j.comgeo.2017.02.003zbMath1445.68240OpenAlexW2589843288MaRDI QIDQ1616243
Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee, Aritra Banik
Publication date: 1 November 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.02.003
Analysis of algorithms and problem complexity (68Q25) Continuous location (90B85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial games (91A46)
Related Items (5)
Voronoi games using geodesics ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane ⋮ The 1-dimensional discrete Voronoi game ⋮ Voronoi game on polygons ⋮ The one-round multi-player discrete Voronoi game on grids and trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal strategies for the one-round discrete Voronoi game on a line
- Voronoi game on graphs
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions
- The one-round Voronoi game replayed
- Facility location problems in the plane based on reverse nearest neighbor queries
- Competitive spatial models
- The one-round Voronoi game
- Competitive facility location: the Voronoi game
- New variations of the maximum coverage facility location problem
- Finding a guard that sees most and a shop that sells most
- The Voronoi game on graphs and its complexity
- Advantage in the discrete Voronoi game
- Nash Equilibria in Voronoi Games on Graphs
- On Approximating the Depth and Related Problems
- The Discrete Voronoi Game in a Simple Polygon
- Competitive Location Models: A Framework and Bibliography
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
This page was built for publication: The discrete Voronoi game in \(\mathbb{R}^2\)
