Time- and storage-efficient implementation of an optimal planar convex hull algorithm

Abstract An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.