Finding minimum hidden guard sets in polygons --- tight approximability results

DOI10.1016/J.COMGEO.2006.01.004MaRDI QIDQ2489014zbMATH OpenOpenAlexFDO

Authors Stephan J. Eidenbenz

Publication date 16 May 2006

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.01.004

zbMATH Keywords

approximation algorithmart gallery problemsinapproximabilityminimum Hidden guard setpolygonsterrainsvisibility

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 2089209
• Inapproximability results for guarding polygons and terrains
• Fast vertex guarding for polygons with and without holes
• Approximability of guarding weak visibility polygons
• Hiding people in polygons

Cites work

• Approximating the minimum maximal independence number
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for terrain guarding.
• Automata, Languages and Programming
• Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
• Computational complexity of art gallery problems
• Hiding people in polygons
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Inapproximability results for guarding polygons and terrains
• On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time

Cited in

(4)

• Hiding people in polygons
• Approximability of guarding weak visibility polygons
• scientific article; zbMATH DE number 2089209 (Why is no real title available?)
• Inapproximability of finding maximum hidden sets on polygons and terrains

This page was built for publication: Finding minimum hidden guard sets in polygons --- tight approximability results

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