License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2017.11
URN: urn:nbn:de:0030-drops-71975
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7197/
Go to the corresponding LIPIcs Volume Portal


Ashok, Pradeesha ; Fomin, Fedor V. ; Kolay, Sudeshna ; Saurabh, Saket ; Zehavi, Meirav

Exact Algorithms for Terrain Guarding

pdf-format:
LIPIcs-SoCG-2017-11.pdf (0.8 MB)


Abstract

Given a 1.5-dimensional terrain T, also known as an x-monotone polygonal chain, the Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the points on T. Here, we say that a point p guards a point q if no point of the line segment pq is strictly below T. The Terrain Guarding problem has been extensively studied for over 20 years. In 2005 it was already established that this problem admits a constant-factor approximation algorithm [SODA 2005]. However, only in 2010 King and Krohn [SODA 2010] finally showed that Terrain Guarding is NP-hard. In spite of the remarkable developments in approximation algorithms for Terrain Guarding, next to nothing is known about its parameterized complexity. In particular, the most intriguing open questions in this direction ask whether it admits a subexponential-time algorithm and whether it is fixed-parameter tractable. In this paper, we answer the first question affirmatively by developing an n^O(sqrt{k})-time algorithm for both Discrete Terrain Guarding and Continuous Terrain Guarding. We also make non-trivial progress with respect to the second question: we show that Discrete Orthogonal Terrain Guarding, a well-studied special case of Terrain Guarding, is fixed-parameter tractable.

BibTeX - Entry

@InProceedings{ashok_et_al:LIPIcs:2017:7197,
  author =	{Pradeesha Ashok and Fedor V. Fomin and Sudeshna Kolay and Saket Saurabh and Meirav Zehavi},
  title =	{{Exact Algorithms for Terrain Guarding}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{11:1--11:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Boris Aronov and Matthew J. Katz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7197},
  URN =		{urn:nbn:de:0030-drops-71975},
  doi =		{10.4230/LIPIcs.SoCG.2017.11},
  annote =	{Keywords: Terrain Guarding, Art Gallery, Exponential-Time Algorithms}
}

Keywords: Terrain Guarding, Art Gallery, Exponential-Time Algorithms
Seminar: 33rd International Symposium on Computational Geometry (SoCG 2017)
Issue Date: 2017
Date of publication: 08.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI