On a convex hull algorithm for polygons and its application to triangulation problems

Abstract A frequently used algorithm for finding the convex hull of a simple polygon in linear running time has been recently shown to fail in some cases. Due to its simplicity the algorithm is, nevertheless, attractive. In this paper it is shown that the algorithm does in fact work for a family of simple polygons known as weakly externally visible polygons. Some application areas where such polygons occur are briefly discussed. In addition, it is shown that with a trivial modification the algorithm can be used to internally and externally triangulate certain classes of polygons in 0( n ) time.

[1]  Peter van Emde Boas,et al.  On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination , 1980, Inf. Process. Lett..

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

[3]  Frans C. A. Groen,et al.  The smallest box around a package , 1981, Pattern Recognit..

[4]  Davis Avis,et al.  On the complexity of finding the convex hull of a set of points , 1982, Discret. Appl. Math..

[5]  Selim G. Akl,et al.  EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .

[6]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

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

[8]  Andrew Chi-Chih Yao,et al.  A Lower Bound to Finding Convex Hulls , 1981, JACM.

[9]  Jack Sklansky,et al.  Recognition of convex blobs , 1970, Pattern Recognit..

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

[11]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[12]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[13]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[14]  Selim G. Akl,et al.  A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..

[15]  Luc Devroye.  A Note on Finding Convex Hulls Via Maximal Vectors , 1980, Inf. Process. Lett..

[16]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[17]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[18]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.