TY - JOUR
T1 - ROBUSTLY GUARDING POLYGONS
AU - Das, Rathish
AU - Filtser, Omrit
AU - Katz, Matthew J.
AU - Mitchell, Joseph S.B.
N1 - Publisher Copyright:
© 2025, Carleton University. All rights reserved.
PY - 2025/5/14
Y1 - 2025/5/14
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/105013872210
U2 - 10.20382/jocg.v16i2a6
DO - 10.20382/jocg.v16i2a6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:105013872210
SN - 1920-180X
VL - 16
SP - 175
EP - 206
JO - Journal of Computational Geometry
JF - Journal of Computational Geometry
IS - 2
ER -