Hiding people in polygons

@article{Shermer1989HidingPI,
  title={Hiding people in polygons},
  author={Thomas C. Shermer},
  journal={Computing},
  year={1989},
  volume={42},
  pages={109-131}
}
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
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A simple proof of the rectilinear art gallery theorem

  • H. Mannila, D. Wood
  • University of Helsinki Computer Science Technical…
  • 1984
1 Excerpt

The Art Gallery Theorems: its Variations, Applications, and Algorithmic Aspects

  • A. Aggarwal
  • PhD Thesis,
  • 1984

Triangulation graphs that require extra guards

  • T. Shermer
  • NYIT Computer Graphics Lab Technical Report
  • 1984

An alternate proofofthe rectilinear art gallery theorem

  • J. O'Rourke
  • J. of Geometry
  • 1983

Galleries need fewer mobile guards: a variation on Chvgtal's theorem

  • J. O'Rourke
  • Geometriae Dedicata
  • 1983

Traditional galleries require fewer watchmen

  • J. Kahn, M. Klawe, D. Kleitman
  • SIAM J. Algebraic and Discrete Methods
  • 1983
1 Excerpt

An O (nlogn) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals

  • Sack, J.-R
  • Proceedings of the 20th Annual Conference on…
  • 1982
1 Excerpt