M. [. Amenta, D. Bern, and . Eppstein, Optimal Point Placement for Mesh Smoothing, Journal of Algorithms, vol.30, issue.2, pp.302-322, 1999.
DOI : 10.1006/jagm.1998.0984

P. Alliez, D. Cohen-steiner, M. Yvinec, and M. Desbrun, Variational tetrahedral meshing, Proc. of ACM SIGGRAPH 2005, pp.617-625, 2005.
DOI : 10.1145/1186822.1073238
URL : https://hal.archives-ouvertes.fr/inria-00226418

C. [. Antani, P. Delage, and . Alliez, Mesh Sizing with Additively Weighted Voronoi Diagrams, Proc. of the 16th Int. Meshing Roundtable, pp.335-346, 2007.
DOI : 10.1007/978-3-540-75103-8_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.565.6175

I. Boivin and C. Ollivier-gooch, Guaranteed-quality triangular mesh generation for domains with curved boundaries, International Journal for Numerical Methods in Engineering, vol.24, issue.10, pp.1185-1213, 2002.
DOI : 10.1002/nme.542

C. [. Boissonnat, M. Wormser, and . Yvinec, Curved Voronoi Diagrams, Effective Comp. Geometry for Curves and Surfaces, pp.67-116, 2007.
DOI : 10.1007/978-3-540-33259-6_2
URL : https://hal.archives-ouvertes.fr/hal-00488446

. W. Cde-+-00-]-s, T. K. Cheng, H. Dey, M. A. Edelsbrunner, S. H. Facello et al., Sliver exudation, Journal of the ACM, vol.47, issue.5, pp.883-904, 2000.

T. [. Cheng, J. Dey, and . Levine, A Practical Delaunay Meshing Algorithm for a Large Class of Domains*, Proc. of the 16th Int. Meshing Roundtable, pp.477-494, 2007.
DOI : 10.1007/978-3-540-75103-8_27

T. [. Cheng, E. A. Dey, and . Ramos, Delaunay Refinement for Piecewise Smooth Complexes, Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms, pp.1096-1105, 2007.
DOI : 10.1007/s00454-008-9109-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.9945

]. L. Che89 and . Chew, Guaranteed-quality triangular meshes, 1989.

]. L. Che93 and . Chew, Guaranteed-quality mesh generation for curved surfaces, SCG '93: Proceedings of the ninth annual symposium on Computational geometry, pp.274-280, 1993.

J. [. Chen and . Xu, Optimal delaunay triangulations Van den Bergen. Efficient collision detection of complex deformable models using aabb trees. Graphics Tools: The Jgt Editors' Choice, Journal of Computational Mathematics, vol.22, issue.2, pp.299-308, 2004.

V. [. Du, M. Faber, and . Gunzburger, Centroidal Voronoi Tessellations: Applications and Algorithms, SIAM Review, vol.41, issue.4, pp.637-676, 1999.
DOI : 10.1137/S0036144599352836
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.146

C. [. Freitag and . Ollivier-gooch, Tetrahedral mesh improvement using swapping and smoothing, International Journal for Numerical Methods in Engineering, vol.5, issue.21, pp.3979-4002, 1997.
DOI : 10.1002/(SICI)1097-0207(19971115)40:21<3979::AID-NME251>3.0.CO;2-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.7581

J. [. Klingner and . Shewchuk, Aggressive Tetrahedral Mesh Improvement, Proceedings of the 16th International Meshing Roundtable, pp.3-23, 2007.
DOI : 10.1007/978-3-540-75103-8_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.8020

[. Li, Sliver-free Three Dimensional Delaunay Mesh Generation, 2000.

J. [. Labelle and . Shewchuk, Isosurface stuffing: fast tetrahedral meshes with good dihedral angles, International Conference on Computer Graphics and Interactive Techniques, 2007.

N. [. Nave, L. P. Chrisochoides, and . Chew, Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains, Proceedings of the eighteenth annual symposium on Computational geometry, pp.135-144, 2002.
DOI : 10.1016/j.comgeo.2004.03.009

]. J. [-rup95 and . Ruppert, A delaunay refinement algorithm for quality 2-dimensional mesh generation, Journal of Algorithms, vol.18, issue.3, pp.548-585, 1995.

M. [. Rineau and . Yvinec, Meshing 3D Domains Bounded by Piecewise Smooth Surfaces*
DOI : 10.1007/978-3-540-75103-8_25
URL : https://hal.archives-ouvertes.fr/hal-00681581

]. J. She98 and . Shewchuk, Tetrahedral mesh generation by delaunay refinement, Proc. of the Fourteenth Annual Symp. on Comp. Geometry, pp.86-95, 1998.

]. J. She02a and . Shewchuk, Delaunay refinement algorithms for triangular mesh generation, Computational Geometry: Theory and Applications, vol.22, issue.1-3, pp.21-74, 2002.

]. J. She02b and . Shewchuk, What is a good linear element? interpolation, conditioning, and quality measures, Proc. of the 11th Int. Meshing Roundtable, pp.115-126, 2002.

[. Si, TETGEN, a quality tetrahedral mesh generator and three-dimensional delaunay triangulator

[. Terdiman, OPCODE 3D collision detection library, 2005.

T. Vieira, L. Lewiner, H. Velho, G. Lopes, and . Tavares, Stellar Mesh Simplification Using Probabilistic Optimization, Computer Graphics Forum, vol.8, issue.2, pp.825-838, 2004.
DOI : 10.1111/1467-8659.00236
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.8673

L. [. Wu and . Kobbelt, Fast mesh decimation by multiple-choice techniques. Vision, Modeling, and Visualization, pp.241-249, 2002.

I. Unité-de-recherche-inria-sophia and . Antipolis, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399