ACM SIGACT News
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Guarding disjoint triangles and claws in the plane
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Guarding galleries and terrains
Information Processing Letters
Covering a line segment with variable radius discs
Computers and Operations Research
An art gallery-based approach: roadmap construction and path planning in global environments
International Journal of Robotics and Automation
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
An efficient strategy for fast object search considering the robot's perceptual limitations
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Radar placement along banks of river
Journal of Global Optimization
Normal art galleries: Wall in - all in
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Art gallery problems which have been extensively studied over the last decade ask how to station a small (minimum) set of guards in a polygon such that every point of the polygon is watched by at least one guard. The graph-theoretic formulation and solution to the gallery problem for polygons in standard form is given. A complexity analysis is carried out, and open problems are discussed.