Art gallery theorems and algorithms
Art gallery theorems and algorithms
On the rectilinear art gallery problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Illuminating rectangles and triangles in the plane
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Guarding rectangular art galleries
Discrete Applied Mathematics
On illuminating line segments in the plane
Discrete Mathematics
Illumination in the presence of opaque line segments in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.04 |
A labyrinth is set L of line segments in the plane (E^2) such that the line segments have pairwise disjoint relative interiors and their complement E^2\@?L is connected. This paper gives combinatorial bounds on four classical illumination problems for labyrinths. For comparison, we refer to bounds on the corresponding problems in the presence of disjoint opaque line segments.