Illumination of Orthogonal Polygons with Orthogonal Floodlights

DOI10.1142/S0218195998000035MaRDI QIDQ4513201zbMATH OpenFDO

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

Publication date 7 November 2000

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

Full work available at URL https://doi.org/10.1142/S0218195998000035

zbMATH Keywords

art gallery theoremsfloodlightsilluminationvisibility

Mathematics Subject Classification ID

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

Recommendations

• Illumination with orthogonal floodlights
• Illumination of polygons with vertex lights
• scientific article; zbMATH DE number 1728324
• Illumination of polygons by 45\(^{\circ}\)-floodlights
• How to guard orthogonal polygons: diagonal graphs and vertex covers

Cites work

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

Cited in

(18)

• Illuminating a convex polygon with vertex lights
• Note on an art gallery problem
• Modem illumination of monotone polygons
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
• Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• A note on optimal floodlight illumination of stages
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• Separating bichromatic point sets in the plane by restricted orientation convex hulls
• Light Orthogonal Networks with Constant Geometric Dilation
• Two-floodlight illumination of convex polygons
• The dispersive art gallery problem
• On the complexity of half-guarding monotone polygons
• Illumination with orthogonal floodlights
• On half guarding polygons
• Floodlight illumination of infinite wedges
• Efficient real-time and parallel algorithm for connected orthogonal convex hulls on large point sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513201)