Finding the convex hull of a simple polygon in linear time

Pattern Recognition

Volumn 19, Issue 6, 1986, Pages 453-458

  Shin, S Y ^a   Woo, T C ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Computational geometry; Convex hull; Linear algorithm

Indexed keywords

CONVEX HULL LOCATION; SIMPLE POLYGON IN LINEAR TIME;

MATHEMATICAL TECHNIQUES;

EID: 0022915541     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(86)90043-9     Document Type: Article

References (12)

1. A linear time algorithm for obtaining the convex hull of a simple polygon
2. A linear time algorithm for finding the convex hull of a simple polygon
3. On finding the convex hull of a simple polygon
4. Finding the convex hull of a simple polygon
5. Measuring concavity on a rectangular mosaic
6. Convex hull of a finite set of points in two dimensions
7. On a convex hull algorithm and its application to triangulation problems
8. On the condition for success of Sklansky's convex hull algorithm
9. Finding the convex hull of a simple polygon
10. A counterexample to an algorithm for computing monotone hulls of simple polygons