The one-round Voronoi game replayed (Q705543): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.comgeo.2004.05.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COMGEO.2004.05.005 / rank | |||
Normal rank | |||
Revision as of 07:30, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The one-round Voronoi game replayed |
scientific article |
Statements
The one-round Voronoi game replayed (English)
0 references
31 January 2005
0 references
The authors resolve a number of problems raised by \textit{O. Cheong, S. Har-Peled, N. Linial} and \textit{J. Matousek} [The one-round Voronoi game, Discrete Comput. Geom. 31, 125--138 (2004; Zbl 1079.91010)]. A precise characterisation of the outcome of the game for optimal play is given. Furthermore, complexity aspects of the game are studied for a particular case.
0 references
Voronoi game
0 references
optimal play
0 references
Voronoi diagram
0 references
game theory
0 references
computational geometry
0 references
competitive facility location
0 references
2-person games
0 references
NP-hardness
0 references
