论文信息 - Finding the convex hull of a simple polygon in linear time

Finding the convex hull of a simple polygon in linear time

Abstract Though linear algorithms for finding the convex hull of a simply-connected polygon have been reported, not all are short and correct. A compact version based on Sklansky's original idea (7) and Bykat's counter-example (8) is given. Its complexity and correctness are also shown.

Sung Yong Shin | Tony C. Woo | Sung-yong Shin | T. Woo

[1] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[2] Marian Orlowski. On the conditions for success of sklansky's convex hull algorithm , 1983, Pattern Recognit..

[3] Godfried T. Toussaint,et al. A counterexample to an algorithm for computing monotone hulls of simple polygons , 1983, Pattern Recognit. Lett..

[4] A. Bykat,et al. Convex Hull of a Finite Set of Points in Two Dimensions , 1978, Inf. Process. Lett..

[5] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[6] Jack Sklansky,et al. Finding the convex hull of a simple polygon , 1982, Pattern Recognit. Lett..

[7] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[8] Subir Kumar Ghosh,et al. A linear time algorithm for obtaining the convex hull of a simple polygon , 1983, Pattern Recognit..