Visibility of a Moving Segment Observer

In this paper we study combinatorial segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-overlapping convex objects in the plane, and we have a segment observer among them. We first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles