Share Email Print

Proceedings Paper

Computational problems in strong visibility
Author(s): Eugene Fink; Derick Wood
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 20 October 1997
PDF: 11 pages
Proc. SPIE 3168, Vision Geometry VI, (20 October 1997); doi: 10.1117/12.279654
Show Author Affiliations
Eugene Fink, Carnegie Mellon Univ. (United States)
Derick Wood, Hong Kong Univ. of Science and Technology (Hong Kong)

Published in SPIE Proceedings Vol. 3168:
Vision Geometry VI
Robert A. Melter; Angela Y. Wu; Longin Jan Latecki, Editor(s)

© SPIE. Terms of Use
Back to Top