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. Alliez, O. Devillers, and J. Snoeyink, Removing degeneracies by perturbing the problem or the world, Reliable Computing, vol.6, issue.1, pp.61-79, 2000.
DOI : 10.1023/A:1009942427413
URL : https://hal.archives-ouvertes.fr/inria-00338566

S. Cheng and T. K. Dey, Quality Meshing with Weighted Delaunay Refinement, Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pp.137-146, 2002.
DOI : 10.1137/S0097539703418808

S. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S. Teng, Sliver exudation, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, pp.1-13, 1999.
DOI : 10.1145/304893.304894

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

O. Devillers, ON DELETION IN DELAUNAY TRIANGULATIONS, International Journal of Computational Geometry & Applications, vol.12, issue.03, pp.193-205, 2002.
DOI : 10.1142/S0218195902000815
URL : https://hal.archives-ouvertes.fr/hal-01179435

O. Devillers, S. Meiser, and M. Teillaud, The space of spheres, a geometric tool to unify duality results on Voronoi diagrams, Proc. 4th Canad. Conf. Comput. Geom, pp.263-268, 1992.
URL : https://hal.archives-ouvertes.fr/hal-01180157

K. Tamal, J. Dey, and . Giesen, Detecting undersampling in surface reconstruction, Proc. 17th Annu. ACM Sympos, pp.257-263, 2001.

M. B. Dillencourt, Realizability of delaunay triangulations, Information Processing Letters, vol.33, issue.6, pp.283-287, 1990.
DOI : 10.1016/0020-0190(90)90210-O

H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990.
DOI : 10.1145/77635.77639

H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete & Computational Geometry, vol.24, issue.1, pp.25-44, 1986.
DOI : 10.1007/BF02187681

S. Funke and K. Mehlhorn, Look --- a Lazy Object-Oriented Kernel for geometric computation, Proceedings of the sixteenth annual symposium on Computational geometry , SCG '00, pp.156-165, 2000.
DOI : 10.1145/336154.336196

M. Heller, Triangulation algorithms for adaptive terrain modeling, Proc. 4th Internat. Sympos. Spatial Data Handling, pp.163-174, 1990.

F. Hurtado, M. Noy, and J. Urrutia, Flipping Edges in Triangulations, Discrete & Computational Geometry, vol.22, issue.3, pp.333-346, 1999.
DOI : 10.1007/PL00009464

A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 1992.

R. Seidel, The Nature and Meaning of Perturbations in Geometric Computing, Discrete & Computational Geometry, vol.19, issue.1, pp.1-17, 1998.
DOI : 10.1007/PL00009330