scientific article; zbMATH DE number 6861950
From MaRDI portal
Publication:4636499
DOI10.4230/LIPIcs.ISAAC.2016.17zbMath1398.68614arXiv1604.07100MaRDI QIDQ4636499
Saeed Mehrabi, Therese C. Biedl
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1604.07100
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ The dispersive art gallery problem ⋮ On \(r\)-guarding SCOTs -- a new family of orthogonal polygons ⋮ Finding minimum witness sets in orthogonal polygons ⋮ On Guarding Orthogonal Polygons with Sliding Cameras ⋮ Mobile versus point guards ⋮ Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
This page was built for publication: