Learn More
A set <i>G</i> of points on a 1.5-dimensional terrain, also known as an <i>x</i>-monotone polygonal chain, is said to guard the terrain if every point on the terrain is seen by a point in <i>G</i>. Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain. The minimum terrain guarding problem(More)
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [2] and Mustafa and Ray [15]. Our key contribution is to show the existence of a planar graph that appropriately relates(More)
We obtain a polynomial time approximation scheme for the 1.5D terrain guarding problem, improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [3] and Mustafa and Ray [18]. Our key contribution is to show the existence of a planar graph that appropriately(More)
We show that vertex guarding a monotone polygon is NP-hard and construct a constant factor approximation algorithm for interior guarding monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of(More)
Given a metric <i>d</i> defined on a set <i>V</i> of points (a metric space), we define the ball B(<i>v, r</i>) centered at <i>u</i> &#8712; <i>V</i> and having radius <i>r</i> &#8805; 0 to be the set {<i>q</i> &#8712; <i>V/d(v, q)</i> &#8804;<i>r</i>}. In this work, we consider the problem of computing a minimum cost <i>k</i>-cover for a given set <i>P</i>(More)
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point of the terrain is seen by at least one guard. This improves on the currently best approximation factor of 5 (see [14]). Unlike most of the previous techniques, our method is based on rounding the linear programming relaxation of the(More)
Given an n-point metric (P , d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a randomized algorithm that runs in n O(log n·log) time and returns with high probability the optimal solution. Here, is the ratio between the maximum and minimum interpoint distances in the(More)
A set G of points on a 1.5-dimensional terrain, also known as an x-monotone polygonal chain, is said to guard the terrain if any point on the terrain is seen by a point in G. Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain. The minimum terrain guarding problem asks for a minimum(More)