Illuminating disjoint line segments in the plane

DOI10.1007/s00454-003-2797-9zbMath1048.52013OpenAlexW1519914687MaRDI QIDQ1434256

Csaba D. Tóth

Publication date: 7 July 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2797-9

zbMATH Keywords

illuminationvisibilitysimple graphdual graphconvex partitionmatching technique

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

Line segment visibility with sidedness constraints ⋮ Watchman routes for lines and line segments ⋮ Encompassing colored planar straight line graphs ⋮ THE MINIMUM GUARDING TREE PROBLEM ⋮ The searchlight problem for road networks

Cites Work

• Illuminating rectangles and triangles on the plane
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Combinatorial problems on the illumination of convex bodies
• An efficient algorithm for guard placement in polygons with holes
• Packing paths of length at least two
• Generalized planar matching
• Illumination of convex discs
• An art gallery theorem for line segments in the plane
• On the completeness of a generalized matching problem
• The k‐piece packing problem
• Visible Shorelines
• Illumination in the presence of opaque line segments in the plane
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Illuminating disjoint line segments in the plane