Publication:4038729
From MaRDI portal
zbMath0765.68208MaRDI QIDQ4038729
Publication date: 18 May 1993
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Vertex Guarding for Dynamic Orthogonal Art Galleries, The dispersive art gallery problem, How to guard orthogonal polygons: diagonal graphs and vertex covers, The art gallery theorem for polyominoes, Guarding galleries and terrains, Illuminating labyrinths., Illuminating disjoint line segments in the plane, Tight bounds for conflict-free chromatic guarding of orthogonal art galleries, Guarding disjoint triangles and claws in the plane, Generalized guarding and partitioning for rectilinear polygons, Vertex-to-point conflict-free chromatic guarding is NP-hard, Clearing an orthogonal polygon to find the evaders, Covering orthogonal polygons with sliding \(k\)-transmitters, Guarding orthogonal art galleries with sliding cameras, Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes, A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras, On Some City Guarding Problems