Voronoi games using geodesics

DOI10.1007/978-3-030-95018-7_16MaRDI QIDQ6102276zbMATH OpenOpenAlexFDO

Authors Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda

Publication date 8 May 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-95018-7_16

zbMATH Keywords

combinatorial optimizationcomputational geometryfacility locationconvex polygonorthogonal polygonrectilinear polygonVoronoi gameorthogonal convex polyhedron

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Competitive facility location: the Voronoi game
• Euclidean shortest paths in the presence of rectilinear barriers
• On one-round discrete voronoi games
• Optimal strategies for the one-round discrete Voronoi game on a line
• The 1-dimensional discrete Voronoi game
• The discrete Voronoi game in \(\mathbb{R}^2\)
• The discrete Voronoi game in a simple polygon
• The one-round Voronoi game
• The one-round Voronoi game replayed
• Voronoi game on polygons

Cited in

(2)

• Maximum Neighbour Voronoi Games
• Rectilinear Voronoi games with a simple rectilinear obstacle in plane

This page was built for publication: Voronoi games using geodesics

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