Two-floodlight illumination of convex polygons

DOI10.1007/3-540-60220-8_51zbMath1502.68316OpenAlexW1531152131MaRDI QIDQ5057422

Jorge Urrutia, Vladimir Estivill-Castro

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_51

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Note on an art gallery problem ⋮ Illumination by floodlights ⋮ Floodlight illumination of infinite wedges

Cites Work

• Unnamed Item
• Illuminating rectangles and triangles on the plane
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A short proof of Chvatal's Watchman Theorem
• Illumination of polygons with vertex lights
• A combinatorial theorem in plane geometry
• Traditional Galleries Require Fewer Watchmen
• Illumination of convex discs
• The Floodlight Problem

This page was built for publication: Two-floodlight illumination of convex polygons