On Visibility Problems in the Plane -- Solving Minimum Vertex Guard Problems by Successive Approximations
نویسندگان
چکیده
We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. It is known that this is an NP-hard Art Gallery Problem with relevant practical applications. In this paper we present an approximation method that solves the problem by successive approximations, which we introduced in [21]. We report on some results of its experimental evaluation and describe two algorithms for characterizing visibility from a point, that we designed for its implementation.
منابع مشابه
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may be directly extended to terrains along the lines of [4]. A major idea in our approach is to explore dominance of visibility regions to first detect pieces that are more difficult to guard.
متن کاملFast Approximation Algorithms for Art Gallery Problems in Simple Polygons
We present approximation algorithms with O(n) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n) time algorithms of Ghosh. For simple polygon, there are O(n) visibility regions, thus any approximation algorithm for the set covering problem with approximation ratio of log(n) can be used for the approximation of n vertex and edge g...
متن کاملApproximability of guarding weak visibility polygons
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for...
متن کاملVertex Guarding in Weak Visibility Polygons
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for...
متن کاملCombinatorial geometry of point sets with collinearities
In this thesis we study various combinatorial problems relating to the geometry of point sets in the Euclidean plane. The unifying theme is that all the problems involve point sets that are not in general position, but have some collinearities. As well as giving rise to natural and interesting problems, the study of point sets with collinearities has important connections to other areas of math...
متن کامل