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 and M. Teillaud, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.2, pp.339-35410, 1993.
DOI : 10.1016/0304-3975(93)90024-N
URL : https://hal.archives-ouvertes.fr/inria-00075419

L. Keneth, P. W. Clarkson, and . Shor, Applications of random sampling in computational geometry, II. Discrete & Computational Geometry, vol.4, pp.387-42110, 1989.

O. Devillers, THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.163-180, 2002.
DOI : 10.1016/S0925-7721(96)00025-9
URL : https://hal.archives-ouvertes.fr/inria-00166711

O. Devillers, M. Glisse, X. Goaoc, and R. Thomasse, Smoothed complexity of convex hulls by witnesses and collectors, Journal of Computational Geometry, vol.7, issue.2, pp.101-144
URL : https://hal.archives-ouvertes.fr/hal-01285120