Guarding disjoint triangles and claws in the plane

DOI10.1016/S0925-7721(02)00130-XzbMath1022.52002OpenAlexW1972506990MaRDI QIDQ1873155

Csaba D. Tóth

Publication date: 19 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00130-x

zbMATH Keywords

matchingplanar graphart gallery

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (1)

Convex partitions with 2-edge connected dual graphs

Cites Work

• Illuminating rectangles and triangles on the plane
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• An efficient algorithm for guard placement in polygons with holes
• A combinatorial theorem in plane geometry
• Illumination of convex discs
• Illumination in the presence of opaque line segments in the plane
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guarding disjoint triangles and claws in the plane