Guarding galleries and terrains

Abstract

Let P be a simple polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficient approximation algorithms for finding the smallest set S of points of P so that each point of P is seen by at least one point of S. We also present similar algorithms for terrains and polygons with holes.