Illumination of Orthogonal Polygons with Orthogonal Floodlights

DOI10.1142/S0218195998000035zbMath0957.68117MaRDI QIDQ4513201

Jorge Urrutia, Thomas C. Shermer, James Abello, Vladimir Estivill-Castro

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

illuminationvisibilityart gallery theoremsfloodlights

Mathematics Subject Classification ID

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

Related Items (9)

Note on an art gallery problem ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ The dispersive art gallery problem ⋮ On the complexity of half-guarding monotone polygons ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations ⋮ Floodlight illumination of infinite wedges ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision

Cites Work

• Triangulating a simple polygon in linear time
• Illumination of polygons with vertex lights
• Traditional Galleries Require Fewer Watchmen

This page was built for publication: Illumination of Orthogonal Polygons with Orthogonal Floodlights