Planar Strong Visibility
Document Type
Article
Publication Date
2003
Keywords
Generalized visibility, convexity, restricted orientations
Digital Object Identifier (DOI)
https://doi.org/10.1142/S0218195903001116
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, and describe algorithms for the following tasks:
1. Testing the strong visibility of two points in a polygon.
2. Finding the strong convex hull of a point set or polygon.
3. Constructing the strong kernel of a polygon.
4. Identifying the points that are strongly visible from a given point.
Was this content written or created while at USF?
Yes
Citation / Publisher Attribution
International Journal of Computational Geometry & Applications, v. 13, issue 2, p. 173-187
Scholar Commons Citation
Fink, Eugene and Wood, Derick, "Planar Strong Visibility" (2003). Computer Science and Engineering Faculty Publications. 142.
https://digitalcommons.usf.edu/esb_facpub/142
