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.
| Original language | English |
|---|---|
| Title of host publication | 40th International Symposium on Computational Geometry, SoCG 2024 |
| Editors | Wolfgang Mulzer, Jeff M. Phillips |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (Electronic) | 9783959773164 |
| DOIs | |
| State | Published - Jun 2024 |
| Event | 40th International Symposium on Computational Geometry, SoCG 2024 - Athens, Greece Duration: 11 Jun 2024 → 14 Jun 2024 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 293 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 40th International Symposium on Computational Geometry, SoCG 2024 |
|---|---|
| Country/Territory | Greece |
| City | Athens |
| Period | 11/06/24 → 14/06/24 |
Bibliographical note
Publisher Copyright:© Rathish Das, Omrit Filtser, Matthew J. Katz, and Joseph S.B. Mitchell.
Keywords
- approximation algorithms
- geometric optimization
- guarding