Translator Disclaimer
20 October 1997 Computational problems in strong visibility
Author Affiliations +
Abstract
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Eugene Fink and Derick Wood "Computational problems in strong visibility", Proc. SPIE 3168, Vision Geometry VI, (20 October 1997); https://doi.org/10.1117/12.279654
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
KEYWORDS
Back to Top