A. Aggarwal, L. Guibas, J. Saxe, and &. P. Shor, A linear-time algorithm for computing the voronoi diagram of a convex polygon, Discrete & Computational Geometry, vol.9, issue.6, pp.591-604, 1989.
DOI : 10.1007/BF02187749

N. Amenta, S. Choi, and &. G. Rote, Incremental constructions con BRIO, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.211-219, 2003.
DOI : 10.1145/777792.777824
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5683

J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and &. M. Yvinec, Triangulations in CGAL, Computational Geometry, vol.22, issue.1-3, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408

L. Carter and &. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences, vol.18, issue.2, pp.143-154, 1979.
DOI : 10.1016/0022-0000(79)90044-8

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

L. P. Chew, Building Voronoi diagrams for convex polygons in linear expected url time, 1990.

L. P. Chew, Guaranteed-quality mesh generation for curved surfaces, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, pp.274-280, 1993.
DOI : 10.1145/160985.161150

S. Choi, The Delaunay tetrahedralization from Delaunay triangulated surfaces, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.145-150, 2002.
DOI : 10.1145/513400.513419

O. Devillers, THE DELAUNAY HIERARCHY, doi [12] O. Devillers. On deletion in Delaunay triangulations, pp.163-180, 2002.
DOI : 10.1142/S0129054102001035
URL : https://hal.archives-ouvertes.fr/inria-00166711

O. Devillers, Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization, Computational Geometry, vol.44, issue.3, pp.169-177, 2011.
DOI : 10.1016/j.comgeo.2010.10.001
URL : https://hal.archives-ouvertes.fr/inria-00560379

J. Erickson, Nice point sets can have nasty Delaunay triangulations, Discrete doi and Computational Geometry, pp.109-132, 2003.

B. Joe, Three-Dimensional Triangulations from Local Transformations, SIAM Journal on Scientific and Statistical Computing, vol.10, issue.4, pp.718-741, 1989.
DOI : 10.1137/0910044

D. Lee and &. K. Lin, Generalized delaunay triangulation for planar graphs, Discrete & Computational Geometry, vol.3, issue.3, pp.201-217, 1986.
DOI : 10.1007/BF02187695

O. Schrijvers, Insertions and deletions in Delaunay triangulations using guided url point location, 2012.