Galleries need fewer mobile guards: A variation on Chvatal's theorem

DOI10.1007/BF00146907zbMath0516.05018OpenAlexW1970673729WikidataQ61940279 ScholiaQ61940279MaRDI QIDQ1052325

Joseph O'Rourke

Publication date: 1983

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00146907

zbMATH Keywords

polygonart gallery theoreminterior line segments

Mathematics Subject Classification ID

Designs and configurations (05B99)

Related Items (22)

Edge guards for polyhedra in three-space ⋮ Hiding people in polygons ⋮ Cooperative mobile guards in grids ⋮ Total dominating sets in maximal outerplanar graphs ⋮ Partial domination of maximal outerplanar graphs ⋮ On Some City Guarding Problems ⋮ Improved Bounds for Wireless Localization ⋮ Art gallery theorems for guarded guards. ⋮ Extensions of the Art Gallery Theorem ⋮ Total domination in plane triangulations ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ Open Guard Edges and Edge Guards in Simple Polygons ⋮ Improved bounds for guarding plane graphs with edges ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ Approximation algorithms for art gallery problems in polygons ⋮ Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ Combinatorial bounds on paired and multiple domination in triangulations ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Semipaired domination in maximal outerplanar graphs ⋮ Improved bounds for guarding plane graphs with edges ⋮ On the number of guard edges of a polygon

This page was built for publication: Galleries need fewer mobile guards: A variation on Chvatal's theorem