Parameter Analysis for Guarding Terrains

Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)961-981
Number of pages21
Issue number4
StatePublished - 1 Apr 2022


  • Kernelization
  • Reflex vertices
  • Terrain Guarding
  • Terrain minima
  • XP algorithm

ASJC Scopus subject areas

  • Computer Science (all)
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Parameter Analysis for Guarding Terrains'. Together they form a unique fingerprint.

Cite this