Efficient algorithms for computing the maximum distance between two finite planar sets

Hierarchical Clustering Schemes

S. C. Johnson · Psychometrika · 1967 · 4.9K citations

Computing, Computer Science, Computational Geometry +11

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

On the Average Number of Maxima in a Set of Vectors and Applications

Jon Bentley, H. T. Kung, Mario Schkolnick et al. · Journal of the ACM · 1978 · 372 citations · Full text

Computing, Computer Science, Algorithms +4

Geometric complexity

Michael Ian Shamos · 1975 · 264 citations

Computing, Computer Science, Mathematics +13

PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY.

Godfried T. Toussaint · Unknown conference · 1980 · 184 citations

Computing, Computer Science, Mathematics +12