Illumination of Orthogonal Polygons with Orthogonal Floodlights
From MaRDI portal
Publication:4513201
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)
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
The dispersive art gallery problem, On the complexity of half-guarding monotone polygons, Floodlight illumination of infinite wedges, Note on an art gallery problem, 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, A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set, A fast and efficient algorithm for determining the connected orthogonal convex hulls, Separating bichromatic point sets in the plane by restricted orientation convex hulls
Cites Work