ROBUSTLY GUARDING POLYGONS

Rathish Das; Omrit Filtser; Matthew J. Katz; Joseph S.B. Mitchell

doi:10.20382/jocg.v16i2a6

ROBUSTLY GUARDING POLYGONS

Rathish Das
, Omrit Filtser
, Matthew J. Katz
, Joseph S.B. Mitchell

Computer Science

Research output: Contribution to journal › Article › peer-review

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
Pages (from-to)	175-206
Number of pages	32
Journal	Journal of Computational Geometry
Volume	16
Issue number	2
DOIs	https://doi.org/10.20382/jocg.v16i2a6
State	Published - 14 May 2025

Bibliographical note

Publisher Copyright:
© 2025, Carleton University. All rights reserved.

Access to Document

10.20382/jocg.v16i2a6

Cite this

@article{4fd3332211ab48b0b4a7ec9c9ccef70e,

title = "ROBUSTLY GUARDING POLYGONS",

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.",

author = "Rathish Das and Omrit Filtser and Katz, \{Matthew J.\} and Mitchell, \{Joseph S.B.\}",

year = "2025",

month = may,

day = "14",

doi = "10.20382/jocg.v16i2a6",

language = "אנגלית",

volume = "16",

pages = "175--206",

journal = "Journal of Computational Geometry",

issn = "1920-180X",

publisher = "Carleton University",

number = "2",

}

TY - JOUR

T1 - ROBUSTLY GUARDING POLYGONS

AU - Das, Rathish

AU - Filtser, Omrit

AU - Katz, Matthew J.

AU - Mitchell, Joseph S.B.

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 -

ROBUSTLY GUARDING POLYGONS

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this