Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane

Document Type

Conference Article

Publication Title

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

Abstract

We study two player single round rectilinear Voronoi games in the plane for a finite set of clients where service paths are obstructed by a rectilinear polygon. The players wish to maximize the net number of their clients where a client is served by the nearest facility of players in L1 metric. We prove the tight bounds for the payoffs of both the players for the class of games with simple, convex and orthogonal convex polygons. We also generalize the results for L∞ metric in the plane.

First Page

89

Last Page

100

DOI

10.1007/978-3-031-25211-2_7

Publication Date

1-1-2023

This document is currently not available here.

Share

COinS