Illumination in the presence of opaque line segments in the plane

DOI10.1016/S0925-7721(01)00057-8zbMath0998.68194MaRDI QIDQ5959562

Csaba D. Tóth

Publication date: 14 March 2002

Published in: Computational Geometry (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Guarding disjoint triangles and claws in the plane ⋮ Alternating paths along axis-parallel segments ⋮ Disjoint compatible geometric matchings ⋮ Watchman routes for lines and line segments ⋮ Illuminating labyrinths. ⋮ Illuminating disjoint line segments in the plane ⋮ THE MINIMUM GUARDING TREE PROBLEM ⋮ The searchlight problem for road networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Illuminating rectangles and triangles on the plane
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Guarding rectangular art galleries
• An efficient algorithm for guard placement in polygons with holes
• Matching and spanning in certain planar graphs
• Computational complexity of art gallery problems
• Illumination of convex discs
• Inapproximability results for guarding polygons and terrains

This page was built for publication: Illumination in the presence of opaque line segments in the plane