An efficient and numerically correct algorithm for the 2D convex hull problem

An efficient and numerically correct program called FastHull for computing the convex hulls of finite point sets in the plane is presented. It is based on the Akl-Toussaint algorithm and the MergeHull algorithm. Numerical correctness of the FastHull procedure is ensured by using special routines for interval arithmetic and multiple precision arithmetic. The FastHull algorithm guaranteesO(N logN) running time in the worst case and has linear time performance for many kinds of input patterns. It appears that the FastHull algorithm runs faster than any currently known 2D convex hull algorithm for many input point patterns.

[1]  Michael Ian Shamos,et al.  Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..

[2]  M. Iri,et al.  Practical use of Bucketing Techniques in Computational Geometry , 1985 .

[3]  Zahid Hussain,et al.  A fast approximation to a convex hull , 1988, Pattern Recognit. Lett..

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

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

[8]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[9]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[10]  Bernard W. Silverman,et al.  Constructing the Convex Hull of a Set of Points in the Plane , 1979, Comput. J..

[11]  Robert Sedgewick,et al.  Analysis of a simple yet efficient convex hull algorithm , 1988, SCG '88.

[12]  Donald C. S. Allison,et al.  Some performance tests of convex hull algorithms , 1984, BIT.

[13]  William F. Eddy,et al.  A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.

[14]  Arne Maus,et al.  Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

[15]  Franco P. Preparata,et al.  Approximation algorithms for convex hulls , 1982, CACM.