Dynamic computational geometry

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

1972 • 1,579 citations

Closest-point problems

1975 • 1,071 citations

On Finding the Maxima of a Set of Vectors

1975 • 913 citations

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

1983 • 818 citations

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

1977 • 701 citations

Lower bounds for algebraic computation trees

1983 • 532 citations

Geometric complexity

1975 • 267 citations

A Lower Bound to Finding Convex Hulls

1981 • 158 citations

Divide-and-conquer in multidimensional space

1976 • 150 citations

On the complexity of computations under varying sets of primitives

1979 • 118 citations

Dynamic computational geometry

1983 • 87 citations

Linear-time algorithms for linear programming in R3 and related problems

1982 • 83 citations

On the Ω(n log n) lower bound for convex hull and maximal vector determination

1980 • 28 citations