. Cgal, Computational Geometry Algorithms Library

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

F. Aurenhammer, Power Diagrams: Properties, Algorithms and Applications, SIAM Journal on Computing, vol.16, issue.1, pp.78-96, 1987.
DOI : 10.1137/0216006

J. Boissonnat and M. Yvinec, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998

A. Bowyer, Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-166, 1981.
DOI : 10.1093/comjnl/24.2.162

K. Q. Brown, Voronoi diagrams from convex hulls, Information Processing Letters, vol.9, issue.5, pp.223-228, 1979.
DOI : 10.1016/0020-0190(79)90074-7

S. Cheng and T. K. Dey, Quality Meshing with Weighted Delaunay Refinement, SIAM Journal on Computing, vol.33, issue.1, pp.69-93, 2003.
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.883-904, 2000.
DOI : 10.1145/304893.304894

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

O. Devillers and M. Teillaud, Perturbations and vertex removal in a 3D Delaunay triangulation, Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp.313-319, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00166710

K. Tamal, J. Dey, and . Giesen, Detecting undersampling in surface reconstruction, Proc. 17th Annu. 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

E. Fogel and M. Teillaud, Generic programming and the CGAL library, Effective Computational Geometry for Curves and Surfaces, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01053388

S. J. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, vol.14, issue.1-4, pp.153-174, 1987.
DOI : 10.1007/BF01840357

S. Pion and M. Teillaud, 3D triangulation, p.3, 2006.

]. E. Schönhardt, ???ber die Zerlegung von Dreieckspolyedern in Tetraeder, Mathematische Annalen, vol.98, issue.1, pp.309-312, 1928.
DOI : 10.1007/BF01451597

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

K. Sugihara, Sliver-free perturbation for the Delaunay tetrahedrization, Computer-Aided Design, vol.39, issue.2, pp.87-94, 2007.
DOI : 10.1016/j.cad.2006.10.002

C. K. Yap, A geometric consistency theorem for a symbolic perturbation scheme, Journal of Computer and System Sciences, vol.40, issue.1, pp.2-18, 1990.
DOI : 10.1016/0022-0000(90)90016-E