Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
From MaRDI portal
Publication:3404426
DOI10.1007/978-3-642-11440-3_3zbMath1274.68627OpenAlexW1798390956MaRDI QIDQ3404426
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_3
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
On boundaries of highly visible spaces and applications ⋮ Facets for art gallery problems ⋮ Approximability of guarding weak visibility polygons
This page was built for publication: Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
