Guarding Thin Orthogonal Polygons Is Hard

DOI10.1007/978-3-642-40164-0_29zbMath1390.68326OpenAlexW2196720455MaRDI QIDQ2842794

Ana Paula Tomás

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_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 (5)

On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons ⋮ On \(r\)-guarding SCOTs -- a new family of orthogonal polygons ⋮ On Guarding Orthogonal Polygons with Sliding Cameras ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation

This page was built for publication: Guarding Thin Orthogonal Polygons Is Hard