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

DOI10.1016/J.COMGEO.2006.01.004zbMATH Open1157.65329OpenAlexW2075805556MaRDI QIDQ2489014FDOQ2489014

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

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

zbMATH Keywords

approximation algorithmpolygonsinapproximabilityvisibilityart gallery problemsterrainsminimum Hidden guard set

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for NP-hard problems.
• Approximating the minimum maximal independence number
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Inapproximability results for guarding polygons and terrains
• Computational complexity of art gallery problems
• Hiding people in polygons
• On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
• Approximation algorithms for terrain guarding.
• Inapproximability of finding maximum hidden sets on polygons and terrains

Cited In (4)

• Hiding people in polygons
• Inapproximability of finding maximum hidden sets on polygons and terrains
• Title not available (Why is that?)
• Approximability of guarding weak visibility polygons

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)