Illumination of Orthogonal Polygons with Orthogonal Floodlights
From MaRDI portal
Publication:4513201
DOI10.1142/S0218195998000035zbMATH Open0957.68117MaRDI QIDQ4513201FDOQ4513201
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)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
Cited In (15)
- On the complexity of half-guarding monotone polygons
- Two-floodlight illumination of convex polygons
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Illumination with orthogonal floodlights
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- On half guarding polygons
- Floodlight illumination of infinite wedges
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- A note on optimal floodlight illumination of stages
- Note on an art gallery problem
- The dispersive art gallery problem
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Illuminating a convex polygon with vertex lights
- Light Orthogonal Networks with Constant Geometric Dilation
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)