Voronoi game on polygons

DOI10.1016/j.tcs.2021.06.023OpenAlexW3176159039MaRDI QIDQ2044961

Sandip Das, Aritra Banik, Anil Maheshwari, Arun Kumar Das, Swami Sarvottamananda

Publication date: 11 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.023

zbMATH Keywords

convex polygonconvex polytopecombinatorial geometryfacility locationcomputational geometrygeometric optimizationgeodesic distanceVoronoi gameellipse intersection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Voronoi games using geodesics ⋮ Rectilinear Voronoi games with a simple rectilinear obstacle in plane

Cites Work

• Unnamed Item
• Unnamed Item
• The one-round Voronoi game replayed
• The one-round Voronoi game
• The discrete Voronoi game in \(\mathbb{R}^2\)
• Competitive facility location: the Voronoi game
• The discrete Voronoi game in a simple polygon
• A short course in computational geometry and topology
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• The Voronoi game on graphs and its complexity
• Euclidean shortest paths in the presence of rectilinear barriers

This page was built for publication: Voronoi game on polygons