Small-dimensional linear programming and convex hulls made easy

Algorithms in Combinatorial Geometry.

Jacob E. Goodman, Herbert Edelsbrunner · American Mathematical Monthly · 1989 · 1.8K citations

Natural Sciences, Mathematics, Algorithms +3

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

Applications of random sampling in computational geometry, II

Kenneth L. Clarkson · 1988 · 943 citations · Full text

Computing, Computer Science, Mathematics +10

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

Nimrod Megiddo · SIAM Journal on Computing · 1983 · 834 citations

Computing, Computer Science, Mathematics +12

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