Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results

DOI10.1007/978-3-642-40313-2_29zbMath1400.68247OpenAlexW132285569MaRDI 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

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 ⋮ 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

This page was built for publication: Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results