GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS

DOI10.1142/S0218195911003639zbMath1216.65028MaRDI QIDQ2999096

Gila Morgenstern, Matthew J. Katz

Publication date: 11 May 2011

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

perfect graphslink distanceorthogonal polygonsmobile guardsart-gallery

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Guarding monotone art galleries with sliding cameras in linear time ⋮ A Scheme for Computing Minimum Covers within Simple Regions ⋮ Guarding orthogonal art galleries with sliding cameras ⋮ Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras ⋮ A scheme for computing minimum covers within simple regions ⋮ Settling the bound on the rectilinear link radius of a simple rectilinear polygon ⋮ Clearing an orthogonal polygon to find the evaders ⋮ On Guarding Orthogonal Polygons with Sliding Cameras ⋮ Mobile versus point guards ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation ⋮ Covering orthogonal polygons with sliding \(k\)-transmitters

Cites Work

• On rectilinear link distance
• The strong perfect graph theorem
• On guarding the vertices of rectilinear domains
• Convexity and a certain property \(P_ m\)
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons