An art gallery problem

110 Views Asked by At

An art gallery has the shape of a simple $n$-gon. Find the minimum number of watchmen needed to survey the building, no matter how complicated its shape be.

I failed to solve the problem. Please help in details.