SOME PERFORMANCE TESTS OF CONVEX HULL ALGORITHMS
1983) SOME PERFORMANCE TESTS OF CONVEX HULL ALGORITHMS. Technical Report CS83001-R, Computer Science, Virginia Tech. (
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 poi nts in the plane. The Graham algorithm outperformed the others on those distributions where most of the points were on or near the boundary of the hull.
|Item Type:||Departmental Technical Report|
|Keywords:||Convex hull, computational geometry, sorting, distributive partitioning|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||Administrator, Eprints|
|Deposited On:||13 May 2006|