Robustly Guarding Polygons
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要