Illuminating labyrinths Original Research Article

A labyrinth is set L of line segments in the plane image such that the line segments have pairwise disjoint relative interiors and their complement image 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.