Art gallery theorems and algorithms
Art gallery theorems and algorithms
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
Information Processing Letters
Art gallery theorems for guarded guards
Computational Geometry: Theory and Applications
Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
We prove a new theorem for orthogonal art galleries in which the guards must guard one another in addition to guarding the polygonal gallery. A set of points G in a polygon Pn is a k-guarded guard set for Pn provided that (i) for every point x in Pn there exists a point w in G such that x is visible from w ; and (ii) every point in G is visible from at least k other points in G: The polygon Pn is orthogonal provided each interior angle is 90掳 or 270掳. We prove that for k 驴 1 and n 驴 6 every orthogonal polygon with n sides has a k-guarded guard set of cardinality k驴n/6驴 + 驴(n+2)/6驴; this bound is best possible. This result extends our recent theorem that treats the case k = 1.