Orthogonal Terrain Guarding is NP-complete
DOI:
https://doi.org/10.20382/jocg.v10i2a3Abstract
A terrain is an x-monotone polygonal curve, that is, every vertical line crosses the curve at most once. In the Terrain Guarding problem, a special case of the famous art gallery problem, one has to place at most $k$ guards on the vertices of a $n$-vertex terrain, in order to fully see it. In 2010, King and Krohn showed that Terrain Guarding is NP-hard [SODA '10, SIAM J. Comput. '11] thereby solving a long-standing 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 180-degree vertices. They ask if Orthogonal Terrain Guarding is in P or NP-hard. In the same paper, they give a subexponential-time 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})}$ ETH-hardness implied by King and Krohn's result.
In this paper, we adapt the gadgets of King and Krohn to rectilinear terrains in order to prove that even Orthogonal Terrain Guarding is NP-complete. Then, we show how to obtain an improved ETH lower bound of $2^{\Omega(n^{1/3})}$ by refining the quadratic reduction from Planar 3-SAT into a cubic reduction from 3-SAT. [In the conference version of this paper, we mistakenly claim a tighter lower bound.] This works for both Orthogonal Terrain Guarding and Terrain Guarding.
Downloads
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).