The discrete Voronoi game in R^2

DOI10.1016/J.COMGEO.2017.02.003zbMATH Open1445.68240OpenAlexW2589843288MaRDI QIDQ1616243FDOQ1616243

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

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

zbMATH Keywords

Voronoi diagramcompetitive facility locationgeometric depth

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)

Cites Work

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

Cited In (17)

• Voronoi game on polygons
• The Voronoi game on graphs and its complexity
• The one-round multi-player discrete Voronoi game on grids and trees
• Rectilinear Voronoi games with a simple rectilinear obstacle in plane
• Voronoi games using geodesics
• Two-round discrete Voronoi game along a line
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• The discrete Voronoi game in a simple polygon
• Voronoi game on graphs
• Voronoi game on graphs
• Title not available (Why is that?)
• The 1-dimensional discrete Voronoi game
• Competitive facility location: the Voronoi game
• The discrete Voronoi game in a simple polygon
• Optimal strategies for the one-round discrete Voronoi game on a line
• Optimal strategies for the one-round discrete Voronoi game on a line
• Discrete Voronoi games and \(\epsilon\)-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)