Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
From MaRDI portal
Publication:2849920
DOI10.1007/978-3-642-40313-2_29zbMath1400.68247MaRDI QIDQ2849920
Saeed Mehrabi, Stephane Durocher
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_29
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Mobile versus point guards, Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation, Clearing an orthogonal polygon to find the evaders, Covering orthogonal polygons with sliding \(k\)-transmitters, Guarding monotone art galleries with sliding cameras in linear time, Guarding orthogonal art galleries with sliding cameras, On orthogonally guarding orthogonal polygons with bounded treewidth, A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras, On Guarding Orthogonal Polygons with Sliding Cameras