Some performance tests of convex hull algorithms
- 78 Downloads
The two-dimensional convex hull algorithms of Graham, Jarvis, Eddy, and Akl and Toussaint are tested on four different planar point distributions. Some modifications are discussed for both the Graham and Jarvis algorithms. Timings taken of FORTRAN implementations indicate that the Eddy and Akl-Toussaint algorithms are superior on uniform distributions of points in the plane. The Graham algorithm outperforms the others on those distributions where most of the points are on or near the boundary of the hull.
KeywordsConvex hull computational geometry sorting distributive partitioning
Unable to display preview. Download preview PDF.
- 1.A. V. Aho, J. E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).Google Scholar
- 2.S. G. Akl and G. T. Toussaint,Personal communication.Google Scholar
- 5.D. C. S. Allison and M. T. Noga,Usort: an efficient hybrid of distributive partitioning sort, BIT 22, (1982), 136–139.Google Scholar
- 7.A. Bykat,Convex hull of a finite set of points in two dimensions, Info. Proc. Lett. 7, no. 6 (1978), 297–298.Google Scholar
- 9.W. F. Eddy,Algorithm 523 CONVEX, a new convex hull algorithm for planar sets, Collected Algorithms from ACM, (1977), 523P1–523P6.Google Scholar
- 14.M. T. Noga,Convex Hull Algorithms, Masters Thesis, Dept. of Comp. Sci., Virginia Polytechnic Institute and State University, Blacksburg, VA, (1981).Google Scholar
- 15.H. Raynaud,Sur l'enveloppe convexe des nuages des points aleatoires dans R, Appl. Prob. 7, (1970), 35–48.Google Scholar
- 17.J. Sklansky,Measuring concavity on a rectangular mosaic, IEEE Trans. on Computers C-21, no. 12 (1972), 1355–1362.Google Scholar