scientific article
From MaRDI portal
Publication:4038729
zbMath0765.68208MaRDI QIDQ4038729
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Guarding disjoint triangles and claws in the plane ⋮ Tight bounds for conflict-free chromatic guarding of orthogonal art galleries ⋮ Guarding galleries and terrains ⋮ Vertex-to-point conflict-free chromatic guarding is NP-hard ⋮ Vertex Guarding for Dynamic Orthogonal Art Galleries ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ Generalized guarding and partitioning for rectilinear polygons ⋮ Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes ⋮ A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras ⋮ The dispersive art gallery problem ⋮ On Some City Guarding Problems ⋮ Clearing an orthogonal polygon to find the evaders ⋮ Illuminating labyrinths. ⋮ Illuminating disjoint line segments in the plane ⋮ The art gallery theorem for polyominoes ⋮ Covering orthogonal polygons with sliding \(k\)-transmitters ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers
This page was built for publication:
