N. Amenta and M. Bern, Surface Reconstruction by Voronoi Filtering, Discrete & Computational Geometry, vol.22, issue.4, pp.481-504, 1999.
DOI : 10.1007/PL00009475

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.71

M. [. Amenta, D. Bern, and . Eppstein, Optimal Point Placement for Mesh Smoothing, Proceedings of the 8th annual ACM-SIAM Symposium on Discrete Algorithms, pp.528-537, 1997.
DOI : 10.1006/jagm.1998.0984

URL : http://arxiv.org/abs/cs/9809081

D. [. Alliez, M. Cohen-steiner, M. Yvinec, and . Desbrun, Variational tetrahedral meshing, Proceedings of the 16th International Meshing Roundtable, pp.617-625, 2005.
DOI : 10.1145/1073204.1073238

URL : https://hal.archives-ouvertes.fr/inria-00226418

U. A. Acar, B. Hudson, G. L. Miller, T. A. Phillipsatp84-]-d, J. C. Anderson et al., SVR: Practical engineering of a fast 3D meshing algorithm Computational fluid mechanics and heat transfer. Hemisphere, Proceedings of 16th International Meshing Roundtable, pp.45-62, 1984.

S. [. Alliez, C. Tayeb, and . Wormser, AABB tree On the angle condition in the finite element method, SIAM Journal on Numerical Analysis, issue.11, pp.80-214, 1976.

M. Bern, P. Chew, D. Eppstein, and J. Ruppert, Dihedral bounds for mesh generation in high dimensions, Proceedings of the 6th annual ACM-SIAM Symposium on Discrete Algorithms, pp.189-196, 1995.

D. [. Bern, J. Eppstein, . Gilbert-]-j-d, L. J. Boissonnat, S. Guibas et al., Provably good mesh generation Learning smooth objects by probing A pliant method for anisotropic mesh generation, Proceedings of the 31st Annual Symposium on Foundations of Computer Science Proceedings of the 21st annual Symposium on Computational Geometry Nonobtuse triangulation of polygons. Discrete and Computational Geometry Proceedings of the 5th International Meshing Roundtable Boissonnat and S. Oudot. Provably good sampling and meshing of surfaces, pp.231-241, 1988.

C. [. Boivin and . 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

L. [. Bank and . Scott, On the Conditioning of Finite Element Equations with Highly Refined Meshes, Yvinec. Curved Voronoi diagrams . In Effective Computational Geometry for Curves and Surfaces, pp.1383-1394, 1989.
DOI : 10.1137/0726080

M. [. Boltcheva, J. Yvinec, . W. Boissonnat-]-s, T. K. Cheng, and . Dey, Mesh generation from 3d multi-material images Generalized Delaunay Mesh Refinement: From Scalar to Parallel Quality meshing with weighted Delaunay refinement, MICCAI '09: Proceedings of the 12th International Conference on Medical Image Computing and Computer- Assisted Intervention Proceedings of the 15th International Meshing Roundtable Proceedings of the 13th Symposium on Discrete Algorithms, pp.92-563, 2002.

H. [. Cotin, N. Delingette, and . Ayache, Real time volumetric deformable models for surgery simulation, Lecture Notes in Computer Science, vol.1131, issue.5, pp.535-540, 1996.
DOI : 10.1007/BFb0046995

URL : https://hal.archives-ouvertes.fr/inria-00615771

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

T. [. Cheng, J. A. Dey, B. Levine, J. Cutler, L. Dorsey et al., A Practical Delaunay Meshing Algorithm for a Large Class of Domains Simplification and improvement of tetrahedral models for simulation, Proceedings of the 16th International Meshing Roundtable Proceedings of the, pp.477-494, 2004.

S. W. Cheng, T. K. Dey, and T. Ray, Weighted Delaunay Refinement for Polyhedra with Small Angles, Eurographics/ACM SIGGRAPH Symposium on Geometry Processing Proceedings of the 14th International Meshing Roundtable, pp.93-102, 2004.
DOI : 10.1007/3-540-29090-7_20

T. [. Cheng, E. A. Dey, and . Ramos, Delaunay Refinement for Piecewise Smooth Complexes, Proceedings of the 18th Symposium on Discrete Algorithms, pp.1096-1105, 2007.
DOI : 10.1007/s00454-008-9109-3

S. W. Cheng, T. K. Dey, E. A. Ramos, T. Ray, ]. Coll et al., Quality meshing for polyhedra with Small Angles Mesh Modification Under Local Domain Changes, Proceedings of the 20th Symposium on Computational Geometry Proceedings of the 15th International Meshing Roundtable, pp.290-299, 2004.

]. L. Che89a, . P. Chewche89b-]-l, and . Chew, Constrained Delaunay triangulations Guaranteed-quality triangular meshes Guaranteed-quality mesh generation for curved surfaces, Proceedings of the 9th Symposium on Computational Geometry, pp.97-108, 1989.

]. L. Che97 and . Chew, Guaranteed-quality Delaunay meshing in 3D (short version ) Mesh Smoothing Schemes based on Optimal Delaunay Triangulations, Proceedings of the 13th Symposium on Computational Geometry Proceedings of 13th International Meshing Roundtable, pp.391-393, 1997.

]. L. Che05 and . Chen, Robust and accurate algorithms for solving anisotropic singularities The Pennsylvania State University, The Graduate school., dec, 2005.

J. [. Canann, M. L. Tristano, . Statencx04a-]-l, J. Chen, . Xucx04b-]-l et al., An approach to combined Laplacian and optimization-based smoothing for triangular, quadrilateral , and quad-dominant meshes Optimal Delaunay triangulation Optimal delaunay triangulations?3):173?192, mar-apr Uniform convergence of a nonlinear energybased multilevel quantization scheme via Centroidal Voronoi Tessellations, Proceedings of the 7th International Meshing Roundtable Emelianenko, and L. Ju. Convergence of the Lloyd algorithm for computing Centroidal Voronoi Tesselations Classe des Sciences Mathematiques et Naturelles, pp.479-494, 1934.

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

M. [. Du, L. Gunzburger, and . Ju, Constrained Centroidal Voronoi Tessellations for Surfaces, SIAM Journal on Scientific Computing, vol.24, issue.5, p.34, 2003.
DOI : 10.1137/S1064827501391576

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.5034

J. [. Dey, P. L. Levine, and . George, Delpsc, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, pp.220-221, 1995.
DOI : 10.1145/1377676.1377712

X. H. Delingette, L. Pennec, J. Soler, N. Marescaux, and . Ayache, Computational Models for Image-Guided Robot-Assisted and Simulated Medical Interventions, Proceedings of the IEEE, pp.1678-1688, 2006.
DOI : 10.1109/JPROC.2006.880718

URL : https://hal.archives-ouvertes.fr/inria-00615001

D. [. Du and . Wang, Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations Recent progress in robust and quality Delaunay mesh generation, International Journal for Numerical Methods in Engineering Journal of Computational and Applied Mathematics, vol.56, pp.1355-1373, 2002.

D. Guoy, Algorithms in combinatorial geometry An experimental study of sliver exudation, Engineering with computers, vol.18, issue.22, pp.65229-240, 1987.

H. Edelsbrunner, X. Y. Li, G. Miller, A. Stathopoulos, D. Talmor et al., Smoothing and cleaning up slivers Global optimization of mesh quality, Proceedings of the 22nd annual ACM symposium on Theory of computing Tutorial at the 10th International Meshing Roundtable Erten and A. Üngör. Triangulations with locally optimal Steiner points. Eurographics Symposium on Geometry Processing, pp.273-277, 2000.

P. [. Frey and . George, Mesh generation: application to finite elements, ISTE, vol.6, p.17, 2007.
DOI : 10.1002/9780470611166

]. A. Fgk-+-00, G. J. Fabri, L. Giezeman, S. Kettner, S. Schirra et al., onherr. On the design of CGAL, a Computational Geometry Algorithms Library. Software Practice and Experience, pp.1167-1202, 2000.

]. D. Fie88, . Fieldfk94-]-k, L. Forsman, and . Kettunen, Laplacian smoothing and Delaunay triangulations Tetrahedral mesh generation in convex primitives by maximizing solid angles, Communications in Applied Numerical Methods IEEE Transactions on Magnetics, vol.4, issue.305 2, pp.709-712, 1988.

]. P. Fle99 and . Fleischmann, Mesh generation for technology CAD in three dimensions, 1999.

C. [. Freitag and . Ollivier-gooch, Tetrahedral mesh improvement using swapping and smoothing, Proceedings of the 7th International Meshing Roundtable. Citeseer, 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

]. P. Geo91, P. George, and . George, Automatic mesh generation, Tetmesh-GHS3D, Tetrahedral mesh generator. INRIA User's Manual, INRIA (Institut National de Recherche en Informatique et Automatique), pp.18-83, 1991.

T. H. Hoppe, T. Derose, J. Duchamp, W. Mcdonald, and . Stuetzle, Surface reconstruction from unorganized points, ACM SIGGRAPH Computer Graphics, vol.26, issue.2, pp.71-79, 1992.
DOI : 10.1145/142920.134011

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.4735

]. L. Her76, ]. Herrmannjam76, and . Joe, Laplacian-isoparametric grid generation scheme Estimations d'erreur pour des éléments finis droits presque dégénérés, RAIRO Anal Delaunay versus max-min solid angle triangulations for 3- dimensional mesh generation Construction of 3-dimensional improved-quality triangulations using local transformations, Journal of the Engineering Mechanics Division Numer International Journal for Numerical Methods in Engineering SIAM Journal on Scientific Computing, vol.102, issue.166, pp.749-907, 1976.

L. Kharevych, P. Mullen, H. Owhadi, and M. Desbrun, Numerical coarsening of inhomogeneous elastic materials, In ACM SIGGRAPH Transactions on Graphics, vol.28, issue.5 6, p.51, 2009.

M. [. Krysl, . M. Ortizks07-]-b, J. R. Klingner, and . Shewchuk, Variational Delaunay approach to the generation of tetrahedral finite element meshes, Proceedings of the 16th International Meshing Roundtable, pp.1681-1700, 1992.
DOI : 10.1002/nme.91

H. [. Kikuuwe, M. Tabuchi, and . Yamamoto, An edge-based computationally efficient formulation of Saint Venant-Kirchhoff tetrahedral finite elements, ACM Transactions on Graphics, vol.28, issue.1, pp.1-13, 2009.
DOI : 10.1145/1477926.1477934

]. F. Lab06 and . Labelle, Sliver removal by lattice refinement, Proceedings of the 22nd annual Symposium on Computational Geometry, pp.347-356

. Acm-new-york, U. Ny, C. J. Liu, and . Hwang, Software for C 1 surface interpolation New strategy for unstructured mesh generation Sliver-free 3-Dimensional Delaunay Mesh Generation, Mathematical Software AIAA journal, vol.3, issue.69, pp.64161-194, 1977.

]. X. Li00b, ]. S. Lillo82, and . Lloyd, Spacing control and sliver-free Delaunay mesh Least square quantization in PCM Non-distorted texture mapping for sheared triangulated meshes, Proceedings of the 9th International Meshing Roundtable SIGGRAPH Proceedings of the 25th annual conference on Computer graphics and interactive techniques, pp.295-306, 1982.

V. [. Lindstrom and . Pascucci, Visualization of large terrains made easy, Proceedings Visualization, 2001. VIS '01., pp.363-370, 2001.
DOI : 10.1109/VISUAL.2001.964533

J. [. Labelle and . Shewchuk, Isosurface stuffing, Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms, pp.57-66, 2001.
DOI : 10.1145/1276377.1276448

W. Liu, B. Wang, F. Lévy, D. M. Sun, L. Yan et al., On centroidal voronoi tessellation???energy smoothness and fast computation, ACM Transactions on Graphics, vol.28, issue.4, p.96, 2009.
DOI : 10.1145/1559755.1559758

URL : https://hal.archives-ouvertes.fr/inria-00547936

]. P. Mcp-+-09, K. Mullen, D. Crane, Y. Pavlov, M. Tong et al., Energy- Preserving Integrators for Fluid Animation, ACM/SIGGRAPH Transactions on Graphics, vol.28, issue.5 6, 2009.

]. S. Mit94 and . Mitchell, Cardinality bounds for triangulations with bounded minimum angle, 6th Canadian Conference on Computational Geometry, pp.326-331, 1994.

G. L. Miller, S. E. Pav, and N. J. Walkington, WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK, International Journal of Computational Geometry & Applications, vol.15, issue.01, pp.25-54, 1928.
DOI : 10.1142/S0218195905001592

P. Machado, J. Tournois, P. Alliez, and O. Devillers, Filtering relocations on a Delaunay triangulation, 7th Symposium on Geometry Processing, p.81, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00413344

S. [. Mitchell and . Vavasis, Quality Mesh Generation in Higher Dimensions, SIAM Journal on Computing, vol.29, issue.4, p.16, 1996.
DOI : 10.1137/S0097539796314124

]. D. Nay99, ]. D. Naylorncc02, N. Nave, L. P. Chrisochoides, and . Chew, Filling space with tetrahedra Guaranteed quality parallel Delaunay refinement for restricted polyhedral domains Updating quasi-Newton matrices with limited storage, Proceedings of the 18th Symposium on Computational GeometryNoc80] J. Nocedal [ORY05] S. Oudot, L. Rineau, and M. Yvinec. Meshing Volumes Bounded by Smooth Surfaces Proceedings of the 14th International Meshing Roundtable, pp.1383-1395, 1980.

]. S. Owe98 and . Owen, A survey of unstructured mesh generation technology, Proceedings of the 7th International Meshing Roundtable, 1998.

A. H. Pottman, M. Asperl, A. Hofer, D. Kilian, and . Bentley, Architectural geometry, Computers & Graphics, vol.47, issue.5, 2007.
DOI : 10.1016/j.cag.2014.11.002

C. [. Parthasarathy, A. F. Graichen, and . Hathaway, A comparison of tetrahedron quality measures. Finite Elements in Analysis and Design, Persson and G. Strang. A simple mesh generator in MATLAB. SIAM Review, pp.255-261, 1994.

]. J. Psb-+-07, F. Pons, J. Ségonne, L. Boissonnat, M. Rineau et al., High-quality consistent meshing of multi-label datasets, Rin07] L. Rineau. 2D conforming triangulations and meshes, pp.92-130, 2007.

]. J. [-rup93 and . Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation A Delaunay refinement algorithm for quality 2-Dimensional mesh generation, Proceedings of the 4th annual ACM-SIAM Symposium on Discrete Algorithms, pp.83-92, 1993.

M. [. Rineau and . Yvinec, Meshing 3D Domains Bounded by Piecewise Smooth Surfaces*, Proceedings of the 16th International Meshing Roundtable, pp.442-460, 2007.
DOI : 10.1007/978-3-540-75103-8_25

URL : https://hal.archives-ouvertes.fr/hal-00681581

G. Scarella, O. Clatz, S. Lanteri, G. Beaume, S. Oudot et al., Realistic numerical modelling of human head tissue exposure to electromagnetic waves from cellular phones, Proceedings of the 14th annual Symposium on Computational GeometryShe00a] J.R. Shewchuk. Mesh generation for domains with small angles. Proceedings of the 16th annual Symposium on Computational Geometry, pp.501-508, 1988.
DOI : 10.1016/j.crhy.2006.03.002

]. J. She00b, . R. Shewchukshe02a-]-j, and . Shewchuk, Mesh generation for domains with small angles Constrained Delaunay tetrahedralizations and provably good boundary recovery Delaunay refinement algorithms for triangular mesh generation, Proceedings of the 16th Symposium on Computational Geometry Proceedings of the 11th International Meshing Roundtable, pp.1-10, 2000.

]. J. She02c, J. R. Shewchuk, and . Shewchuk, Two discrete optimization algorithms for the topological improvement of tetrahedral meshes Unpublished manuscript What is a good linear element? interpolation, conditioning , and quality measures, Proceedings of the 11th International Meshing RoundtableSi07] H. Si. TetGen, A Quality Tetrahedral Mesh Generator and 3- Dimensional Delaunay Triangulator Available on the web at, pp.65-115, 2002.

G. [. Shewchuk, R. O. Miller, and . David, Delaunay refinement mesh generation, p.14, 1997.

P. [. Tournois, O. Alliez, and . Devillers, Interleaving delaunay refinement and optimization for 2d triangle mesh generation Well-spaced points for numerical methods, Proceedings of the 16th International Meshing Roundtable, p.73, 1997.

]. P. Ter05, R. Terdiman, P. Srinivasan, and . Alliez, OPCODE 3D Collision Detection library Perturbing slivers in 3D Delaunay meshes, Proceedings of the 18th International Meshing Roundtable, p.66, 2005.

J. Tournois, C. Wormser, P. Alliez, and M. Desbrun, Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation Off-centers: A new type of steiner points for computing sizeoptimal quality-guaranteed Delaunay triangulations, LATIN: Latin American Symposium on Theoretical Informatics, pp.1-75, 1981.

J. D. Wendt, W. Baxter, I. Oguz, M. C. Linwk02, ]. J. Wu et al., Finite volume flow simulations on arbitrary domains, ACM/EG Symposium on Geometry Processing / Computer Graphics Forum, pp.19-32, 2002.
DOI : 10.1016/j.gmod.2006.05.004

M. [. Yerry and . Shephard, Automatic three-dimensional mesh generation by the modified-octree technique, International Journal for Numerical Methods in Engineering, vol.11, issue.11, pp.1965-1990, 1984.
DOI : 10.1002/nme.1620201103

. Dans-cette-thèse, une approche pratique pour la génération de maillages triangulaires isotropes est proposée. En 2D comme en 3D, l'objectif consiste à mailler un domaine donné, pouvant avoir une géométrie complexe. L'approche présentée consiste à entrelacer des étapes de