A faster divide-and-conquer algorithm for constructing delaunay triangulations

Computational Geometry--An Introduction.

Mikhail J. Atallah, Franco P. Preparata, Michael Ian Shamos · Mathematics of Computation · 1986 · 4.3K citations

Natural Sciences, Computer Science, Mathematics +8

Two algorithms for constructing a Delaunay triangulation

D. T. Lee, Bruce J. Schachter · International Journal of Parallel Programming · 1980 · 1.6K citations

Computing, Computer Science, Algorithms +8

Primitives for the manipulation of general subdivisions and the computation of Voronoi

Leonidas Guibas, Jorge Stolfi · ACM Transactions on Graphics · 1985 · 1.3K citations · Full text

Computing, Computer Science, Mathematics +14

A sweepline algorithm for Voronoi diagrams

Steven Fortune · Algorithmica · 1987 · 1.1K citations

Computing, Computer Science, Computational Geometry +4

Closest-point problems

Michael Ian Shamos, Dan Hoey · 1975 · 1.1K citations

Computing, Computer Science, Mathematics +15