Planar strong visibility
of Computational Geometry and Applications, to appear.
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, and describe algorithms for the following tasks:
Testing the strong visibility of two points in a polygon.
Finding the strong convex hull of a point set or polygon.
Constructing the strong kernel of a polygon.
Identifying the points that are strongly visible from a given point.