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

N. M. Amato, M. T. Goodrich, and E. A. Ramos, Lineartime triangulation of a simple polygon made easier via randomization, Proc. 16th Annu. ACM Sympos, pp.201-212, 2000.

J. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry, Discrete & Computational Geometry, vol.20, issue.1, pp.51-71, 1992.
DOI : 10.1007/BF02293035
URL : https://hal.archives-ouvertes.fr/inria-00075274

J. Boissonnat, O. Devillers, M. Teillaud, and M. Yvinec, Triangulations in CGAL, Proc. 16th Annu. ACM Sympos, pp.11-18, 2000.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408

J. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.2, pp.339-354, 1993.
DOI : 10.1016/0304-3975(93)90024-N
URL : https://hal.archives-ouvertes.fr/inria-00075419

B. Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, vol.15, issue.3, pp.485-524, 1991.
DOI : 10.1007/BF02574703

B. Chazelle, An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra, SIAM Journal on Computing, vol.21, issue.4, pp.671-696, 1992.
DOI : 10.1137/0221041

L. P. Chew, Building Voronoi diagrams for convex polygons in linear expected time, Dept. Math. Comput. Sci, 1986.

L. P. Chew and S. Fortune, Sorting helps for voronoi diagrams, Algorithmica, vol.20, issue.4, pp.217-228, 1997.
DOI : 10.1007/BF02526034

F. Chin, J. Snoeyink, and C. A. Wang, Finding the Medial Axis of a Simple Polygon in Linear Time, Discrete & Computational Geometry, vol.21, issue.3, pp.405-420, 1999.
DOI : 10.1007/PL00009429

K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, vol.1, issue.5, pp.387-421, 1989.
DOI : 10.1007/BF02187740

O. Mark-de-berg, K. Devillers, O. Dobrindt, and . Schwarzkopf, Computing a single cell in the overlay of two simple polygons, Information Processing Letters, vol.63, issue.4, pp.215-219, 1997.
DOI : 10.1016/S0020-0190(97)00125-7

M. Mark-de-berg, M. Van-kreveld, O. Overmars, and . Schwarzkopf, Computational Geometry: Algorithms and Applications, 1997.

O. Devillers, n) ALGORITHMS FOR DIFFICULT ??(n) PROBLEMS, International Journal of Computational Geometry & Applications, vol.02, issue.01, pp.97-111, 1992.
DOI : 10.1142/S021819599200007X
URL : https://hal.archives-ouvertes.fr/inria-00167206

H. Djidjev and A. Lingas, ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS, International Journal of Computational Geometry & Applications, vol.05, issue.03, pp.327-337, 1995.
DOI : 10.1142/S0218195995000192

L. J. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, vol.134, issue.1-6, pp.381-413, 1992.
DOI : 10.1007/BF01758770

R. Klein and A. Lingas, A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.263-278, 1996.
DOI : 10.1142/S0218195996000198

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

R. Seidel, Backwards Analysis of Randomized Geometric Algorithms, Discrete and Computational Geometry, pp.37-68, 1993.
DOI : 10.1007/978-3-642-58043-7_3

J. Snoeyink and M. Van-kreveld, Good orders for incremental (re)construction, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.400-402, 1997.
DOI : 10.1145/262839.263025