Computational problems in strong visibility

Eugene Fink; Derick Wood

doi:10.1117/12.279654

20 October 1997 Computational problems in strong visibility

Eugene Fink, Derick Wood

Proceedings Volume 3168, Vision Geometry VI; (1997) https://doi.org/10.1117/12.279654
Event: Optical Science, Engineering and Instrumentation '97, 1997, San Diego, CA, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available