Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

DOI10.1007/978-3-642-11440-3_3MaRDI QIDQ3404426zbMATH OpenOpenAlexFDO

Authors Subir Kumar Ghosh

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited in

(7)

• Approximability of guarding weak visibility polygons
• On boundaries of highly visible spaces and applications
• Art Gallery Problems for Convex Nested Polygons
• scientific article; zbMATH DE number 219237 (Why is no real title available?)
• A nearly optimal algorithm for covering the interior of an art gallery
• Efficient mathematical programming formulation and algorithmic framework for optimal camera placement
• Facets for art gallery problems

This page was built for publication: Approximation Algorithms for Art Gallery Problems in Polygons and Terrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404426)