An Approximation Algorithm for the Art Gallery Problem

@inproceedings{Bonnet2017AnAA,
  title={An Approximation Algorithm for the Art Gallery Problem},
  author={{\'E}douard Bonnet and Tillmann Miltzow},
  booktitle={International Symposium on Computational Geometry},
  year={2017}
}
Given a simple polygon $\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\mathcal{P}$. The Point Guard Art Gallery problem asks for a minimum set $S$ such that every point in $\mathcal{P}$ is visible from a point in $S$. The set $S$ is referred to as guards. Assuming integer coordinates and a specific general position assumption, we present the first $O(\log \text{OPT})$-approximation… 

A Practical Algorithm with Performance Guarantees for the Art~Gallery Problem

A one-shot vision stable algorithm that computes an optimal guard set for visionstable polygons using polynomial time and solving one integer program guarantees to find the optimal solution for every vision stable polygon.

Smoothed Analysis of the Art Gallery Problem

The results are that algebraic methods are not needed to solve the Art Gallery Problem in typical instances and the expected number of bits to describe optimal guard positions per guard is logarithmic in the input and the magnitude of the perturbation.

Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards

Three polynomial-time algorithms with a constant approximation ratio for guarding an $n$-sided simple polygon $P$ using vertex guards are presented, settling the conjecture by Ghosh regarding the existence of constant-factor approximation algorithms for this problem.

A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

This paper presents a $(2+\varepsilon)-approximation algorithm for guarding a weakly visible polygon, and presents two algorithms based on an in-depth analysis of the geometric properties of the regions that remain unguarded after placing guards at the vertices to guard the polygon's boundary.

Parameterized Complexity of Geometric Covering Problems Having Conflicts

It is proved that conflict-free version of Covering Points by Intervals does not admit an FPT algorithm, unless FPT =W[1], for the family of conflict graphs for which the Independent Set problem is W[1]-hard.

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery

This paper proposes an algorithm with a constant approximation factor for the point guarding problem where the location of guards is restricted to a grid and the running time depends on the number of cells of the grid.

Parameterized Hardness of Art Gallery Problems

Lower bounds almost match the n^{O(k)} algorithms that exist for both problems, and rule out a f(k)*n^{o(k/log k)} algorithm for any computable function f, where k := |S| is the number of guards.

Irrational Guards are Sometimes Needed

It is shown that there are rectilinear polygons given by integer coordinates that require guards with irrational coordinates in any optimal solution of the art gallery problem.

Topological Art in Simple Galleries

It is shown that for every semi-algebraic set S there is a polygon P such that V (P ) is homotopy equivalent to S, and that for various concrete topological spaces T, instances I of the art gallery problem such as V (I) is homeomorphic to T.

Orthogonal Terrain Guarding is NP-complete

This paper adapts the gadgets of King and Krohn to rectilinear terrains to prove that even Orthogonal Terrain Guarding is NP-complete, and shows how the reduction from Planar 3-SAT can actually be made linear (instead of quadratic).

References

SHOWING 1-10 OF 57 REFERENCES

The Parameterized Hardness of the Art Gallery Problem

Lower bounds almost match the $n^{O(k)}$ algorithms that exist for both problems, and rule out any $f(k)n^{o(k / \log k)}$ algorithm, for any computable function $f$, unless the Exponential Time Hypothesis fails.

Separating a Voronoi Diagram via Local Search

A simple local search algorithm is presented that is a PTAS for geometric hitting set of fat objects (which can also be used to approximate the optimal Voronoi partition).

Parameterized Hardness of Art Gallery Problems

Lower bounds almost match the n^{O(k)} algorithms that exist for both problems, and rule out a f(k)*n^{o(k/log k)} algorithm for any computable function f, where k := |S| is the number of guards.

Minimal Witness Sets For Art Gallery Problems

An algorithm for computing witness sets of points, line segments and, if necessary, regions in O(n 4 ) time is proposed and determines whether guarding the boundary of a polygon is sucient to guard the entire polygon.

A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems

A O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards and it is found that the optimal solution to the art gallery problem where guards are restricted to this set is at most 3copt.

Inapproximability Results for Guarding Polygons and Terrains

This paper proves that if the input polygon has no holes, there is a constant δ >0 such that no polynomial time algorithm can achieve an approximation ratio of 1+δ, for each of these guard problems, and shows inapproximability for the POINT GUARD problem for polygons with holes.

Fast vertex guarding for polygons with and without holes

Algorithms for Polytope Covering and Approximation

An algorithm for polytope covering is given that finds a cover of size no more than c(5dln c), for c large enough, and an approximation with error e requires c=O(d/e)d−1 vertices, and the algorithm gives a approximation with c( 5d3 ln(1/e)) vertices.

The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS

This paper proposes several filtering techniques reducing the size of the discretization, allowing for an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to $10^6$ vertices within minutes on a standard desktop computer.

Recent Results in Art Galleries

Two points in a polygon are called visible if the straight line segment between them lies entirely inside the polygon. The art gallery problem for a polygon P is to find a minimum set of points G in
...