Computational problems in strong visibility

Eugene Fink and Derick Wood

In Proceedings of the Vision Geometry VI Conference, pages 95-105, 1997.


Strong visibility is a generalization of standard visibility, defined with respect to a fixed set of line orientations. We investigate computational properties of this generalized visibility, as well as the related notion of strong convexity. In particular, we describe algorithms for the following tasks: