## Estimating the Maximum Hidden Vertex Set in Polygons

- António Leslie Bajuelos, Santiago Canales, Gregorio Hernández-Peñalver, Ana Mafalda Martins
- International Conference on Computational…
- 2008

Highly Influenced

@article{Shermer1989HidingPI, title={Hiding people in polygons}, author={Thomas C. Shermer}, journal={Computing}, year={1989}, volume={42}, pages={109-131} }

- Published in Computing 1989
DOI:10.1007/BF02239742

A hidden set is a set of points such that no two points in the set are visible to each other. A hidden guard set is a hidden set which is also a guard set. In this paper we consider the problem for finding hidden sets and hidden guard sets in and around polygons. In particular, we establish bounds on the maximum size of hidden sets, and show that the problem of finding a maximum hidden set is NP-hard. For minimum hidden guard sets, similar results are obtained. Eine Versteckmenge ist eine… CONTINUE READING