Illuminating rectangles and triangles on the plane
A set S of light sources, idealized as points, illuminates a collection F of convex sets if each point in the boundary of the sets of F is visible from at least one point in S. For any n disjoint plane isothetic rectangles, \(\lfloor (4n+4)/3\rfloor\) lights are sufficient to illuminate their boundaries. If in addition, the rectangles have equal width, then \(n+2\) lights always suffice and n-1 are occasionally necessary. For any family of n plane triangles, \(\lfloor (4n+4)/3\rfloor\) light sources are sufficient. For collections of n homothetic triangles, \(n+1\) light sources are always sufficient and n-1 are occasionally necessary.
- On illumination in the plane by line segments
- Protecting convex sets
- Note on an art gallery problem
- Illuminating labyrinths.
- Illuminating disjoint line segments in the plane
- Guarding disjoint triangles and claws in the plane
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
- scientific article; zbMATH DE number 140478 (Why is no real title available?)
- The Floodlight Problem
- Acute triangles in the context of the illumination problem
- Two-floodlight illumination of convex polygons
- Illumination in the presence of opaque line segments in the plane
This page was built for publication: Illuminating rectangles and triangles on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757841)
