Parameter Analysis for Guarding Terrains

Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi

Abstract

The Terrain Guarding problem is a well-known variant of the famous Art Gallery problem. Only second to Art Gallery, it is the most well-studied visibility problem in Discrete and Computational Geometry, which has also attracted attention from the viewpoint of Parameterized complexity. In this paper, we focus on the parameterized complexity of Terrain Guarding (both discrete and continuous) with respect to two natural parameters. First we show that, when parameterized by the number r of reflex vertices in the input terrain, the problem has a polynomial kernel. We also show that, when parameterized by the number c of minima in the terrain, Discrete Orthogonal Terrain Guarding has an XP algorithm.
BibTeX
@inproceedings{agrawal2022parameter,
  author = {Akanksha Agrawal and Sudeshna Kolay and Meirav Zehavi},
  title = {{Parameter Analysis for Guarding Terrains}},
  booktitle = {Algorithmica},
  year = {2022},
  url = {https://openreview.net/forum?id=MWUu4NOQuK},
}

Loading related content...

Figure