Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.
- AMS subject classification code (1991): 52A30
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics