Maximum Neighbour Voronoi Games

DOI10.1007/978-3-642-00202-1_9MaRDI QIDQ3605489zbMATH OpenOpenAlexFDO

Authors M.D. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman

Publication date 24 February 2009

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00202-1_9

zbMATH Keywords

Delaunay triangulationVoronoi diagramcompetitive facility locationVoronoi games

Mathematics Subject Classification ID

Applications of game theory (91A80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Recommendations

• Voronoi game on graphs
• Voronoi game on graphs
• Voronoi choice games
• Voronoi game on polygons
• Voronoi Games on Cycle Graphs
• Voronoi games using geodesics
• The Voronoi game on graphs and its complexity
• The discrete Voronoi game in a simple polygon
• The discrete Voronoi game in a simple polygon
• The 1-dimensional discrete Voronoi game

Cites work

• scientific article; zbMATH DE number 1979535 (Why is no real title available?)
• scientific article; zbMATH DE number 2081000 (Why is no real title available?)
• scientific article; zbMATH DE number 1798165 (Why is no real title available?)
• scientific article; zbMATH DE number 1424293 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Competitive facility location: the Voronoi game
• Finding a guard that sees most and a shop that sells most
• The one-round Voronoi game
• The one-round Voronoi game replayed

Cited in

(1)

• Competitive facility location: the Voronoi game

This page was built for publication: Maximum Neighbour Voronoi Games

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