Voronoi Games Using Geodesics

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

In this paper, we study the single-round geodesic Voronoi games on various classes of polygons and polyhedra for two players. We prove some tight bounds on the payoffs, that is, the number of clients served by both the first player, Alice, and the second player, Bob, for orthogonal convex polygons and polyhedra for the L1 metric.

First Page

195

Last Page

207

DOI

10.1007/978-3-030-95018-7_16

Publication Date

1-1-2022

This document is currently not available here.

Share

COinS