strong kernel
Recently Published Documents


TOTAL DOCUMENTS

8
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2009 ◽  
Vol 64 (1) ◽  
pp. 41-50 ◽  
Author(s):  
Claudia Zepeda ◽  
José Luis Carballido
Keyword(s):  

2004 ◽  
Vol 22 (3) ◽  
pp. 713-722 ◽  
Author(s):  
Shaowen Li ◽  
Xiaofeng Liao ◽  
Chunguang Li

2003 ◽  
Vol 13 (02) ◽  
pp. 173-187
Author(s):  
EUGENE FINK ◽  
DERICK WOOD

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.


Sign in / Sign up

Export Citation Format

Share Document