In this paper, first we consider the problem of finding the minimum number of floodlights that can illuminate the interior of an orthogonal polygon when the range of illumination is restricted to 60°. Then we study this problem for the pseudo-triangles. In general, we want to guard an environment with cameras in order to ensure that every point in the environment is seen from at least one camera. We intend to minimize the total number of cameras required and also the cameras can see a limited range. This problem is answered before for some range of visions but there was only a conjecture for 60°-cameras [6]. We prove the correctness of this conjecture for the orthogonal polygons and the pseudo-triangles.