Abstract
A terrain is an xmonotone polygonal curve, i.e., successive vertices have increasing xcoordinates. Terrain Guarding can be seen as a special case of the famous art gallery problem where one has to place at most k guards on a terrain made of n vertices in order to fully see it. In 2010, King and Krohn showed that Terrain Guarding is NPcomplete [SODA '10, SIAM J. Comput. '11] thereby solving a longstanding open question. They observe that their proof does not settle the complexity of Orthogonal Terrain Guarding where the terrain only consists of horizontal or vertical segments; those terrains are called rectilinear or orthogonal. Recently, Ashok et al. [SoCG'17] presented an FPT algorithm running in time k^{O(k)}n^{O(1)} for Dominating Set in the visibility graphs of rectilinear terrains without 180degree vertices. They ask if Orthogonal Terrain Guarding is in P or NPhard. In the same paper, they give a subexponentialtime algorithm running in n^{O(sqrt n)} (actually even n^{O(sqrt k)}) for the general Terrain Guarding and notice that the hardness proof of King and Krohn only disproves a running time 2^{o(n^{1/4})} under the ETH. Hence, there is a significant gap between their 2^{O(n^{1/2} log n)}algorithm and the no 2^{o(n^{1/4})} ETHhardness implied by King and Krohn's result.
In this paper, we answer those two remaining questions. We adapt the gadgets of King and Krohn to rectilinear terrains in order to prove that even Orthogonal Terrain Guarding is NPcomplete. Then, we show how their reduction from Planar 3SAT (as well as our adaptation for rectilinear terrains) can actually be made linear (instead of quadratic).
BibTeX  Entry
@InProceedings{bonnet_et_al:LIPIcs:2018:8724,
author = {{\'E}douard Bonnet and Panos Giannopoulos},
title = {{Orthogonal Terrain Guarding is NPcomplete}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {11:111:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770668},
ISSN = {18688969},
year = {2018},
volume = {99},
editor = {Bettina Speckmann and Csaba D. T{\'o}th},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8724},
URN = {urn:nbn:de:0030drops87246},
doi = {10.4230/LIPIcs.SoCG.2018.11},
annote = {Keywords: terrain guarding, rectilinear terrain, computational complexity}
}
Keywords: 

terrain guarding, rectilinear terrain, computational complexity 
Seminar: 

34th International Symposium on Computational Geometry (SoCG 2018) 
Issue Date: 

2018 
Date of publication: 

24.05.2018 