Divide and conquer for linear expected time

An efficient algorith for determining the convex hull of a finite planar set

Ronald Graham · Information Processing Letters · 1972 · 1.7K citations

Computing, Computer Science, Algorithms +12

Closest-point problems

Michael Ian Shamos, Dan Hoey · 1975 · 1.1K citations

Computing, Computer Science, Mathematics +15

Convex hulls of finite sets of points in two and three dimensions

F. P. Preparata, S. J. Hong · Communications of the ACM · 1977 · 706 citations · Full text

Computing, Computer Science, Algorithms +15

On the identification of the convex hull of a finite set of points in the plane

R.A. Jarvis · Information Processing Letters · 1973 · 647 citations

Natural Sciences, Mathematics, Computational Geometry +6

Geometric intersection problems

Michael Ian Shamos, Dan Hoey · 1976 · 465 citations

Computing, Computer Science, Mathematics +17