Guarding and covering problems have great importance in Computational Geometry. In this paper the notion of a ray guard, a guard that can only 'see' along a single ray, is introduced. The problem of siting the fewest ...