A fixed-parameter algorithm for guarding 1.5D terrains

A 1.5D terrain is a region on a plane determined by an x-monotone polygonal chain. A set G of points on the terrain is called a guarding set if every point on the terrain is seen by some point in G. In the 1.5D terrain guarding problem we are given a 1.5D terrain and the goal is to find the minimum guarding set for the given input terrain. It is proved that this problem is NP-hard and the only previous theoretical results for this problem involve approximation. In this paper, we turn to fixed-parameter tractability. We present "depth of terrain onion peeling" as a new geometric parameter. Based on this parameter, we give an upper bound for the treewidth of the terrain visibility graph. By presenting a dynamic programming algorithm, we show that the 1.5D terrain guarding problem is fixed-parameter tractable with respect to this parameter. "the depth of the terrain onion peeling" is introduced as a parameter.Tree decomposition of the visibility graph of a 1.5D terrain is constructed and its width is bounded by this parameter."terrain path decomposition" is introduced.A dynamic programming algorithm is presented to produce a solution to the 1.5D terrain guarding problem.1.5D terrain guarding problem is fixed-parameter tractable with respect to "the depth of terrain onion peeling".

[1]  Kenneth L. Clarkson,et al.  Improved Approximation Algorithms for Geometric Set Cover , 2007, Discret. Comput. Geom..

[2]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[5]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[6]  Erik D. Demaine,et al.  Open problems from cccg 2001 , 2001, CCCG.

[7]  Joseph S. B. Mitchell,et al.  A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding , 2007, SIAM J. Comput..

[8]  Matt Gibson,et al.  An Approximation Scheme for Terrain Guarding , 2009, APPROX-RANDOM.

[9]  Erik D. Demaine,et al.  Open Problems: Open Problems from CCCG 2005 , 2006, CCCG.

[10]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[11]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[12]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[13]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[14]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[15]  James King,et al.  A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains , 2006, LATIN.

[16]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[17]  Khaled M. Elbassioni,et al.  Improved Approximations for Guarding 1.5-Dimensional Terrains , 2009, Algorithmica.

[18]  Danny Ziyi Chen,et al.  Optimal guarding of polygons and monotone chains , 1995, CCCG.

[19]  Rolf Niedermeier,et al.  Reflections on Multivariate Algorithmics and Problem Parameterization , 2010, STACS.

[20]  James King,et al.  Terrain Guarding is NP-Hard , 2011, SIAM J. Comput..

[21]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .