Illuminating Both Sides of Line Segments

Authors:
Csaba D. Tóth
Affiliations:
-
Venue:
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Year:
2000

Citing 10
Cited 1

Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Generalized planar matching

Journal of 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
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
On illuminating line segments in the plane

Discrete Mathematics
Galleries, Light Matchings and Visibility Graphs

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Tight Bounds for the Rectangualr Art Gallery Problem

WG '91 Proceedings of the 17th International Workshop
On the completeness of a generalized matching problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Guarding disjoint triangles and claws in the plane

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Quantified Score

Hi-index	0.00

Visualization

Abstract

What is the minimum number of light sources that can collectively illuminate both sides of n disjoint line segments in the plane? We prove that this optimization problem is NP-hard. The worst case analysis shows, however, that 驴4(n + 1)/5驴 lightv sources are always enough and sometimes necessary for all n 驴 2.This problem was motivated by an open problem posed by Czyzowicz et al.: what is the minimal number of light sources that can collectively illuminate any set of n disjoint line segments from one side at least.