. Cgal, Computational Geometry Algorithms Library

N. Amenta, M. Bern, and D. 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

J. Boissonnat, C. Wormser, Y. , and M. , Curved Voronoi Diagrams, Effective Computational Geometry for Curves and Surfaces, pp.67-116, 2006.
DOI : 10.1007/978-3-540-33259-6_2

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

D. Boltcheva, M. Yvinec, and J. Boissonnat, Mesh Generation from 3D Multi-material Images, MICCAI '09: Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention, 2009.
DOI : 10.1007/978-3-642-04271-3_35

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

L. Chen and J. Xu, Optimal Delaunay triangulation, Journal of Computational Mathematics, vol.22, pp.299-308, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01101627

S. Cheng and T. Dey, Quality Meshing with Weighted Delaunay Refinement, Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics Philadelphia, pp.137-146, 2002.
DOI : 10.1137/S0097539703418808

S. Cheng, T. Dey, H. Edelsbrunner, M. 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

S. Cheng, T. Dey, R. , and T. , Weighted Delaunay Refinement for Polyhedra with Small Angles, Proceedings of the 14th Int. Meshing Roundtable, 2005.
DOI : 10.1007/3-540-29090-7_20

L. Chew, Guaranteed-quality Delaunay meshing in 3D (short version), Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.391-393, 1997.
DOI : 10.1145/262839.263018

B. Cutler, J. Dorsey, and L. Mcmillan, Simplification and improvement of tetrahedral models for simulation, Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing , SGP '04, pp.93-102, 2004.
DOI : 10.1145/1057432.1057445

Q. Du, V. Faber, and M. Gunzburger, Centroidal Voronoi Tessellations: Applications and Algorithms, SIAM Review, vol.41, issue.4, pp.637-676, 1999.
DOI : 10.1137/S0036144599352836

H. Edelsbrunner, Algorithms in Comb. Geometry, 1987.

H. Edelsbrunner and D. Guoy, An Experimental Study of Sliver Exudation, Engineering with Computers, vol.18, issue.3, pp.229-240, 2002.
DOI : 10.1007/s003660200020

H. Edelsbrunner, X. Li, G. Miller, A. Stathopoulos, D. Talmor et al., Smoothing and cleaning up slivers, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.273-277, 2000.
DOI : 10.1145/335305.335338

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

K. Forsman and L. Kettunen, Tetrahedral mesh generation in convex primitives by maximizing solid angles, IEEE Transactions on Magnetics, vol.30, issue.5, pp.3535-3538, 1994.
DOI : 10.1109/20.312702

B. Joe, Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation, International Journal for Numerical Methods in Engineering, vol.20, issue.5, 1991.
DOI : 10.1002/nme.1620310511

B. Joe, Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations, SIAM Journal on Scientific Computing, vol.16, issue.6, pp.1292-1307, 1995.
DOI : 10.1137/0916075

B. Klingner and J. Shewchuck, Aggressive Tetrahedral Mesh Improvement, Proceedings of 16th Int. Meshing Roundtable, pp.3-23, 2007.
DOI : 10.1007/978-3-540-75103-8_1

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

P. Krysl and M. Ortiz, Variational Delaunay approach to the generation of tetrahedral finite element meshes, International Journal for Numerical Methods in Engineering, vol.12, issue.7, pp.1681-1700, 2001.
DOI : 10.1002/nme.91

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

X. Li, Sliver-free 3-Dimensional Delaunay mesh generation, 2000.

X. Li, Spacing control and sliver-free Delaunay mesh, Proceedings of the 9th International Meshing Roundtable, pp.295-306, 2000.

X. Li and S. Teng, Generating well-shaped Delaunay meshes in 3D, Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms, pp.28-37, 2001.

C. Liu and C. Hwang, New Strategy for Unstructured Mesh Generation, AIAA Journal, vol.39, issue.6, pp.1078-1085, 2001.
DOI : 10.2514/2.1420

L. Rineau, Y. , and M. , 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

J. Shewchuk, Tetrahedral mesh generation by Delaunay refinement, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.86-95, 1998.
DOI : 10.1145/276884.276894

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

J. Shewchuk, Two discrete optimization algorithms for the topological improvement of tetrahedral meshes, 2002.

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

D. Talmor, Well-spaced points for numerical methods, 1997.

J. Tournois, C. Wormser, P. Alliez, and M. Desbrun, Interleaving delaunay refinement and optimization for practical isotropic tetrahedron mesh generation, ACM Transactions on Graphics, vol.28, issue.3, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359288