The discrete Voronoi game in R^2

DOI10.1016/J.COMGEO.2017.02.003MaRDI QIDQ1616243zbMATH OpenOpenAlexFDO

Authors Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee

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

zbMATH Keywords

competitive facility locationgeometric depthVoronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continuous location (90B85) Combinatorial games (91A46)

Recommendations

• Optimal strategies for the one-round discrete Voronoi game on a line
• The 1-dimensional discrete Voronoi game
• The discrete Voronoi game in a simple polygon
• Optimal strategies for the one-round discrete Voronoi game on a line
• The discrete Voronoi game in a simple polygon

Cites work

• Advantage in the discrete Voronoi game
• Competitive facility location: the Voronoi game
• Competitive Location Models: A Framework and Bibliography
• Competitive spatial models
• Discrete Voronoi games and -nets, in two and three dimensions
• Facility location problems in the plane based on reverse nearest neighbor queries
• Finding a guard that sees most and a shop that sells most
• scientific article; zbMATH DE number 4213496 (Why is no real title available?)
• scientific article; zbMATH DE number 1962801 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• MAXIMIZING A VORONOI REGION: THE CONVEX CASE
• Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
• Nash Equilibria in Voronoi Games on Graphs
• New variations of the maximum coverage facility location problem
• On Approximating the Depth and Related Problems
• Optimal strategies for the one-round discrete Voronoi game on a line
• The discrete Voronoi game in a simple polygon
• The one-round Voronoi game
• The one-round Voronoi game replayed
• The Voronoi game on graphs and its complexity
• Voronoi game on graphs

Cited in

(17)

• Competitive facility location: the Voronoi game
• Voronoi game on polygons
• The 1-dimensional discrete Voronoi game
• The discrete Voronoi game in a simple polygon
• The Voronoi game on graphs and its complexity
• Optimal strategies for the one-round discrete Voronoi game on a line
• Optimal strategies for the one-round discrete Voronoi game on a line
• scientific article; zbMATH DE number 1798165 (Why is no real title available?)
• Voronoi game on graphs
• Voronoi game on graphs
• The discrete Voronoi game in a simple polygon
• Two-round discrete Voronoi game along a line
• The one-round multi-player discrete Voronoi game on grids and trees
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• Voronoi games using geodesics
• Rectilinear Voronoi games with a simple rectilinear obstacle in plane
• Discrete Voronoi games and -nets, in two and three dimensions

This page was built for publication: The discrete Voronoi game in \(\mathbb{R}^2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616243)