On finding the convex hull of a simple polygon

International Journal of Computer & Information Sciences

Volumn 12, Issue 2, 1983, Pages 87-98

  Lee, D T ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

analysis of algorithms; computational geometry; Convex hull; simple polygon

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0020733721     PISSN: 00917036     EISSN: 15737640     Source Type: Journal    
DOI: 10.1007/BF00993195     Document Type: Article

References (16)

1. A fast convex hull algorithm
2. Another efficient algorithm for convex hull in 2-dimensions
3. Convex hull of a finite set of points in two dimensions
4. A new convew hull algorithm for planar sets
5. An efficient algorithm for determining the convex hull of a finite planar set
6. The all nearest neighbor problem for convex polygons
7. A linear time algorithm for finding the convex hull of a simple polygon
8. An optimal real time algorithm for planar convex hulls
9. Convex hulls of finite sets of points in two and three dimensions
10. Measuring concavity on a rectangular mosaic
11. Finding the convex hull of a simple polygon