Computational geometry: an introduction
Computational geometry: an introduction
Art gallery theorems and algorithms
Art gallery theorems and algorithms
The Art Gallery theorem for polygons with holes
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Edge guards in rectilinear polygons
Computational Geometry: Theory and Applications
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
| Hi-index | 0.00 |
We introduce the notion of a normal gallery, a gallery in which any configuration of guards that visually covers the walls necessarily covers the entire gallery. We show that any star gallery is normal and any gallery with at most two reflex corners is normal. A polynomial time algorithm is provided deciding if, for a given gallery and a finite set of positions within the gallery, there exists a configuration of guards in some of these positions that visually covers the walls, but not the entire gallery.