@inproceedings{01629c853894401dbae68bb950c21c78,
title = "Universal guard problems",
abstract = "We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ({"}guards{"}) that are {"}universal{"} in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all polygons in a given set of k polygons on an n-point vertex set. Our upper bound proofs include algorithms to construct universal guard sets of the respective cardinalities.",
keywords = "Art gallery problem, Polygonization, Robust covering, Universal guarding, Worst-case bounds",
author = "Fekete, \{S{\'a}ndor P.\} and Qian Li and Mitchell, \{Joseph S.B.\} and Christian Scheffer",
note = "Publisher Copyright: {\textcopyright} S{\'a}ndor P. Fekete, Qian Li, Joseph S. B. Mitchell, and Christian Scheffer.; 27th International Symposium on Algorithms and Computation, ISAAC 2016 ; Conference date: 12-12-2016 Through 14-12-2016",
year = "2016",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2016.32",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "32.1--32.13",
editor = "Seok-Hee Hong",
booktitle = "27th International Symposium on Algorithms and Computation, ISAAC 2016",
}