Visibility of disjoint polygons
Algorithmica
Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
On the rectilinear art gallery problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The Art Gallery theorem for polygons with holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Guarding rectangular art galleries
Discrete Applied Mathematics
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems
SIAM Journal on Discrete Mathematics
Generalized guarding and partitioning for rectilinear polygons
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Edge guarding polyhedral terrains
Computational Geometry: Theory and Applications
Edge guards in rectilinear polygons
Computational Geometry: Theory and Applications
Decomposing polygonal regions into convex quadrilaterals
SCG '85 Proceedings of the first annual symposium on Computational geometry
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for terrain guarding
Information Processing Letters
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain
Proceedings of the 8th Canadian Conference on Computational Geometry
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
The art gallery theorem: its variations, applications and algorithmic aspects
The art gallery theorem: its variations, applications and algorithmic aspects
Visibility Algorithms in the Plane
Visibility Algorithms in the Plane
Guarding galleries and terrains
Information Processing Letters
Improved Approximation Algorithms for Geometric Set Cover
Discrete & Computational Geometry
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem
SIBGRAPI '07 Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
SIAM Journal on Computing
An IP solution to the art gallery problem
Proceedings of the twenty-fifth annual symposium on Computational geometry
An Approximation Scheme for Terrain Guarding
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Experimental evaluation of an exact algorithm for the orthogonal art gallery problem
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A 4-approximation algorithm for guarding 1.5-dimensional terrains
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this survey paper, we present an overview of approximation algorithms that are designed for art gallery problems in polygons and terrains.