Delaunay refinement algorithms for triangular mesh generation

Babuška, 1976, On the angle condition in the finite element method, SIAM J. Numer. Anal., 13, 214, 10.1137/0713021

Baker, 1988, Nonobtuse triangulation of polygons, Discrete Comput. Geom., 3, 147, 10.1007/BF02187904

de Berg, 1997

Bern, 1992, Mesh generation and optimal triangulation, 1, 23

Bern, 1994, Provably good mesh generation, J. Comput. System Sci., 48, 384, 10.1016/S0022-0000(05)80059-5

Bowyer, 1981, Computing Dirichlet tessellations, Computer J., 24, 162, 10.1093/comjnl/24.2.162

Carey, 1984

Chew, 1989, Constrained Delaunay triangulations, Algorithmica, 4, 97, 10.1007/BF01553881

Chew, 1989

Chew, 1993, Guaranteed-quality mesh generation for curved surfaces, 274

Chew, 1997, Guaranteed-quality Delaunay meshing in 3D, 391

Clarkson, 1989, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4, 387, 10.1007/BF02187740

Dey, 1992, On good triangulations in three dimensions, Internat. J. Comput. Geom. Appl., 2, 75, 10.1142/S0218195992000068

Devillers, 1999, On deletion in Delaunay triangulations, 181

Dwyer, 1987, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Algorithmica, 2, 137, 10.1007/BF01840356

Frey, 1987, Selective refinement: A new strategy for automatic node placement in graded triangular meshes, Internat. J. Numer. Methods Engrg., 24, 2183, 10.1002/nme.1620241111

Guibas, 1985, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics, 4, 74, 10.1145/282918.282923

Jones, 1997, Adaptive refinement of unstructured finite-element meshes, Finite Elements in Analysis and Design, 25, 41, 10.1016/S0168-874X(96)00039-X

Lawson, 1977, Software for C1 surface interpolation, 161

Lee, 1986, Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom., 1, 201, 10.1007/BF02187695

Lee, 1980, Two algorithms for constructing a Delaunay triangulation, Internat. J. Comput. Inform. Sci., 9, 219, 10.1007/BF00977785

Miller, 1997, Optimal good-aspect-ratio coarsening for unstructured meshes, 538

Miller, 1995, A Delaunay based numerical method for three dimensions: Generation, formulation, and partition, 683

Mitchell, 1994, Cardinality bounds for triangulations with bounded minimum angle, 326

Ruppert, 1992

Ruppert, 1993, A new and simple algorithm for quality 2-dimensional mesh generation, 83

Ruppert, 1995, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms, 18, 548, 10.1006/jagm.1995.1021

Seidel, 1992

Shewchuk, 1996, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, 1148, 203

Shewchuk, 1998, Tetrahedral mesh generation by Delaunay refinement, 86

Shewchuk, 2000, Mesh generation for domains with small angles, 1

Watson, 1981, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, Computer J., 24, 167, 10.1093/comjnl/24.2.167