Robustly Guarding Polygons
Computational Geometry
2024-03-19 v1
Abstract
We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of investigation, we show that imposing various degrees of robustness on the notion of visibility coverage leads to a more tractable (and realistic) problem for which we can provide approximation algorithms with constant factor guarantees.
Cite
@article{arxiv.2403.11861,
title = {Robustly Guarding Polygons},
author = {Rathish Das and Omrit Filtser and Matthew J. Katz and Joseph S. B. Mitchell},
journal= {arXiv preprint arXiv:2403.11861},
year = {2024}
}
Comments
To appear in SoCG 2024