Improved Bounds for Planar k -Sets and Related Problems

Algorithms in Combinatorial Geometry.

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

Mathematical Programming, Engineering, Geometry +16

Applications of random sampling in computational geometry, II

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

Applications of random sampling in computational geometry, II

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

Geometric Modeling, Geometric Algorithm, Geometry +4

Combinatorial complexity bounds for arrangements of curves and spheres

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

Discrete Geometry, Engineering, Computational Complexity +5

Graphs drawn with few crossings per edge

János Pach · COMBINATORICA · 1997 · 293 citations · Full text

Geometric Graph Theory, Network Science, Graph Theory +6