Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Illumination of polygons with vertex lights
Information Processing Letters
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Converting triangulations to quadrangulations
Computational Geometry: Theory and Applications
Art gallery problem with guards whose range of vision is 180°
Computational Geometry: Theory and Applications
Art galleries with guards of uniform range of vision
Computational Geometry: Theory and Applications
| Hi-index | 0.05 |
What is the minimal number of floodlights that can illuminate the interior of any polygon with n vertices, provided that every floodlight has an α, α ∈ (0°, 360°], range of illumination? This question is answered in this paper for α ∈ [45°, 60°), stating that this number is n - 1, if n is odd, and n - 2, if n is even. We show also that every simple polygon with 2l + 2 vertices can be partitioned into l quadrilaterals using at most l - 1 Steiner points.