A historical note on convex hull finding algorithms

Bass, 1967, On finding the disc of minimum radius containing a given set of points, Math. Computat., 21, 712 Akl, 1978, Efficient convex hull algorithms for pattern recognition applications, 483 Akl, 1978, A fast convex hull algorithm, Information Processing Letters, 7, 219, 10.1016/0020-0190(78)90003-0 Eddy, 1977, A new convex hull algorithm for planar sets, ACM Trans. Math. Software, 3, 398, 10.1145/355759.355766 Bykat, 1978, Convex hull of a finite set of points in two dimensions, Inform. Process. Lett., 7, 296, 10.1016/0020-0190(78)90021-2 Graham, 1972, An efficient algorithm for determining the convex hull of a planar set, Inform. Process. Lett., 1, 132, 10.1016/0020-0190(72)90045-2 Sklansky, 1972, Measuring concavity on a rectangular mosaic, IEEE Trans. Comput., 21, 1355, 10.1109/T-C.1972.223507 Sklansky, 1982, Finding the convex hull of a simple polygon, Pattern Recognition Lett., 1, 79, 10.1016/0167-8655(82)90016-2 Toussaint, 1982, On a convex hull algorithm for polygons and its application to triangulation problems, Pattern Recognition, 15, 23, 10.1016/0031-3203(82)90057-7 Toussaint, 1983, A counter-example to an algorithm for computing monotone hulls of simple polygons, Pattern Recognition Lett., 1, 219, 10.1016/0167-8655(83)90028-4 McCallum, 1979, A linear time algorithm for finding the convex hull of a simple polygon, Inform. Process. Lett., 8, 201, 10.1016/0020-0190(79)90069-3 Lee, 1980, On finding the convex hull of a simple polygon Graham, R.L. and F.F. Yao. Finding the convex hull of a simple polygon. Journal of Algorithms, to appear. Toussaint, 1981, Computational geometric problems in pattern recognition, 73 Toussaint, 1980, Pattern recognition and geometrical complexity, 1324 Bhattacharya, 1981, A time-and-storage efficient implementation of an optimal planar convex hull algorithm