There are planar graphs almost as good as the complete graph

Two algorithms for constructing a Delaunay triangulation

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

Geometric Modeling, Engineering, Geometric Algorithm +9

A sweepline algorithm for Voronoi diagrams

Steven Fortune · Algorithmica · 1987 · 1.1K citations

Geometric Modeling, Cartography, Engineering +9

Constrained delaunay triangulations

L. Paul Chew · Algorithmica · 1989 · 749 citations

Geometric Modeling, Mathematical Programming, Engineering +10

Proceedings of the 30th IEEE symposium on Foundations of computer science

Zvi Galil, E. K. Blum · Foundations of Computer Science · 1994 · 651 citations

Computational Science, Computational Complexity Theory, Engineering +7

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

Emo Welzl · Information Processing Letters · 1985 · 294 citations

Geometric Modeling, Geometric Graph Theory, Geometric Algorithm +9