2

The question is quite straight-forward but I can't seem to find the correct keywords to get my answer on the internet.

For those who are not familiar with the problem, given a polygon P we are asked to find the minimum number of guards which together can see the whole polygon ( assuming that each guard has a 360 field of view ) . An example of a solution can be seen in the following picture in which two guards suffice :

enter image description here

Now, my question is : If the guards can see all the edges of the polygon (from its interior of course), do they see the whole polygon?

This could do wonders for my solution as I wouldn't have to bother about the guards being able to see the interior of the polygon.

John Katsantas
  • 820
  • 5
  • 15
  • Yes. If you can see an edge, you can see its endpoints so if you can see all edges you can see the entire polygon. – John Douma Jul 05 '19 at 17:29
  • 1
    Well, that means you can see the perimeter of the polygon but not necessarily the interior space of the polygon. It makes sense to me as well, but I've seen some weird polygons when it comes to the "exception" of the rule in computational geometry. For example, a polygon with holes inside might make this more complicated. – John Katsantas Jul 05 '19 at 17:35

1 Answers1

4

No. On the picture below guards in green corners can see the whole perimeter but can not see the region with red points.

edge guards

datjko
  • 181