- Guibas, Stolfi: Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams (1985) (1985)
- Dwyer: A faster divide-and-conquer algorithm for constructing delaunay triangulations (1986)
- Fortune: A sweepline algorithm for Voronoi diagrams (1987)
- Bowyer: Computing Dirichlet tessellations (1977)
- Clarkson, Shor: Applications of random sampling in computational geometry, II (1989)
- Boissonnat et al.: Applications of random sampling to on-line algorithms in computational geometry (1992)
- Fang, Piegl: Delaunay triangulation using a uniform grid (1993)
- Boissonnat, Teillaud: On the randomized construction of the Delaunay tree (1993)
- Lischinski: Incremental Delaunay Triangulation (1994)
- Devillers: Improved Incremental Randomized Delaunay Triangulation (1998)
- Sua, Drysdale: A comparison of sequential Delaunay triangulation algorithms (1996)
- Shewchuk: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator (1996)
- Triangle
- Triangle.NET
- Steiner points
- conforming Delaunay triangulation
- MIConvexHull
- poly2tri