2025/07/31 by Das, Rathish, Filtser, Omrit, Katz, Matthew J. +1
paper · doi:10.20382/jocg.v16i2a6
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.