J. D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry . Discrete and Computational Geometry
URL : https://hal.archives-ouvertes.fr/inria-00075274

B. Chazelle, Triangulating a simple polygon in linear time, IEEE Symposium on Foundations of Computer Science, pp.220-230, 1990.

K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 1989.

K. Mulmuley, On levels in arrangements and voronoi diagrams, Discrete & Computational Geometry, vol.1, issue.3, pp.307-338, 1991.
DOI : 10.1007/BF02574692

K. Mehlhorn, S. Meiser, and C. ´. O-'dúnlaing, On the construction of abstract

J. D. Boissonnat, O. Devillers, and M. Teillaud, A semi-dynamic construction of higher order Vorono¨?Vorono¨? diagrams and its randomized analysis. Algorithmica . To be published, Abstract published in Second Canadian Conference on Computational Geometry, 1990.

L. J. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Delaunay and Vorono¨?Vorono¨? diagrams. Algorithmica

O. Devillers, S. Meiser, and M. Teillaud, Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Computational Geometry Theory and Applications
URL : https://hal.archives-ouvertes.fr/hal-01180164

K. L. Clarkson, K. Mehlhorn, and R. Seidel, Four results on randomized incremental constructions, 1991.

O. Schwarzkopf, Dynamic maintenance of geometric structures made easy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
DOI : 10.1109/SFCS.1991.185369

R. Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry, vol.1, issue.1, 1991.
DOI : 10.1016/0925-7721(91)90012-4

J. D. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree. Theoretical Computer Science
URL : https://hal.archives-ouvertes.fr/inria-00075419

D. T. Lee, On k-nearest neighbor Vorono¨?Vorono¨? diagrams in the plane, IEEE Transactions on Computers, issue.31, pp.478-487, 1982.

F. P. Preparata and M. I. Shamos, Computational Geometry : an Introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6

A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. 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

P. Chew, A simple randomized linear time algorithm for computing the Vorono¨?Vorono¨? diagram of a convex polygon