Applications of random sampling to on-line algorithms in computational geometry

Algorithms in Combinatorial Geometry.

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

Natural Sciences, Mathematics, Algorithms +3

Applications of random sampling in computational geometry, II

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

Computing, Computer Science, Mathematics +10

Applications of random sampling in computational geometry, II

Kenneth L. Clarkson, Peter W. Shor · Discrete & Computational Geometry · 1989 · 664 citations · Full text

Computing, Computer Science, Mathematics +10

Combinatorial complexity bounds for arrangements of curves and spheres

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas Guibas et al. · Discrete & Computational Geometry · 1990 · 324 citations · Full text

Natural Sciences, Computer Science, Mathematics +12

Constructing the visibility graph for n-line segments in O(n2) time

Emo Welzl · Information Processing Letters · 1985 · 296 citations

Computing, Computer Science, Mathematics +12