Maximum Neighbour Voronoi Games

DOI10.1007/978-3-642-00202-1_9zbMath1211.68473OpenAlexW63496923MaRDI QIDQ3605489

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

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

Voronoi diagramDelaunay triangulationcompetitive 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)

Cites Work

• The one-round Voronoi game replayed
• Competitive facility location: the Voronoi game
• Finding a guard that sees most and a shop that sells most
• The one-round Voronoi game
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum Neighbour Voronoi Games