Date of Original Version



Conference Proceeding

Rights Management

Copyright 1997 Society of Photo-Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited

Abstract or Description

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: (1) Testing the strong visibility of two points in a polygon and the strong convexity of a polygon; (2) Finding the strong convex hull of a point set and that of a simple polygon; (3) Constructing the strong kernel of a polygon; (4) Identifying the set of points that are strongly visible from a given point.



Published In

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