Art gallery theorems and algorithms
Art gallery theorems and algorithms
Illumination of polygons with vertex lights
Information Processing Letters
Art gallery problem with guards whose range of vision is 180°
Computational Geometry: Theory and Applications
Allocating vertex π-guards in simple polygons via pseudo-triangulations
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Floodlight illumination of infinite wedges
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
It is shown that any simple polygon with n vertices can be illuminated by at most 驴(3n - 5)/4驴 vertex 驴-floodlights. This improves the earlier bound n-2, whereas the best lower bound remains 3n/5+c.