P. Alliez, L. Rineau, S. Tayeb, J. Tournois, and M. Yvinec, 3D mesh generation, CGAL User and Reference Manual. CGAL Editorial Board, 4.1 edition, 2012.

J. Boissonnat, O. Devillers, and S. Hornus, Incremental construction of the Delaunay graph in medium dimension, Annual Symposium on Computational Geometry, pp.208-216, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00412437

S. Cheng, T. K. Dey, and J. R. Shewchuk, Delaunay Mesh Generation, 2012.

L. P. Chew, Guaranteed-quality triangular meshes, 1989.

K. L. Clarkson, Building triangulations using epsilon-nets, STOC: ACM Symposium on Theory of Computing, pp.326-335, 2006.
DOI : 10.1145/1132516.1132564

P. J. Green and R. Sibson, Computing Dirichlet Tessellations in the Plane, The Computer Journal, vol.21, issue.2, pp.168-173, 1978.
DOI : 10.1093/comjnl/21.2.168

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol.2, 1993.

S. Har-peled and M. Mendel, Fast Construction of Nets in Low-Dimensional Metrics and Their Applications, SIAM Journal on Computing, vol.35, issue.5, pp.1148-1184, 2006.
DOI : 10.1137/S0097539704446281

B. Hudson, G. Miller, and T. Phillips, Sparse Voronoi Refinement, Proceedings of the 15th International Meshing Roundtable, pp.339-356, 2006.
DOI : 10.1007/978-3-540-34958-7_20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Hudson, G. L. Miller, S. Y. Oudot, and D. R. Sheehy, Topological inference via meshing, Proceedings of the 2010 annual symposium on Computational geometry, SoCG '10, pp.277-286, 2010.
DOI : 10.1145/1810959.1811006

URL : https://hal.archives-ouvertes.fr/inria-00436891

J. Matou?ek, Lectures on Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7

G. L. Miller, T. Phillips, and D. R. Sheehy, Beating the spread, Proceedings of the 27th annual ACM symposium on Computational geometry, SoCG '11, pp.321-330, 2011.
DOI : 10.1145/1998196.1998252

G. L. Miller, D. Talmor, S. Teng, and N. Walkington, On the Radius-Edge Condition in the Control Volume Method, SIAM Journal on Numerical Analysis, vol.36, issue.6, pp.1690-1708, 1999.
DOI : 10.1137/S0036142996311854

E. P. Mücke, I. Saias, and B. Zhu, Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, pp.63-83, 1999.

J. Ruppert, A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation, Journal of Algorithms, vol.18, issue.3, pp.548-585, 1995.
DOI : 10.1006/jagm.1995.1021

D. R. Sheehy, Mesh Generation and Geometric Persistent Homology, 2011.

D. R. Sheehy, New Bounds on the Size of Optimal Meshes, Computer Graphics Forum, vol.42, issue.2, pp.1627-1635, 2012.
DOI : 10.1111/j.1467-8659.2012.03168.x

J. R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, Applied Computational Geometry, pp.203-222, 1996.
DOI : 10.1007/BFb0014497

H. Si, TetGen: A quality tetrahedral mesh generator and a 3D Delaunay triangulator, 2011.