Robustly Guarding Polygons
<|reference_start|>Robustly Guarding Polygons: 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.<|reference_end|>
@article{das2024robustly,
    title={Robustly Guarding Polygons},
    author={Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph S.B. Mitchell},
    journal={arXiv preprint arXiv:2403.11861},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.11861},
    primaryClass={cs.CG}
}