C. Susanne, L. Brenner, and L. Scott, The mathematical theory of finite element methods, 1994.

J. Martins, E. Pires, R. Salvado, and P. Dinis, A numerical model of passive and active behavior of skeletal muscles, Computer Methods in Applied Mechanics and Engineering, vol.151, issue.3-4, pp.419-452, 1998.
DOI : 10.1016/S0045-7825(97)00162-X

M. Bro-nielsen and S. Cotin, Real-time Volumetric Deformable Models for Surgery Simulation using Finite Elements and Condensation, Computer Graphics Forum, vol.15, issue.3, pp.57-66, 1996.
DOI : 10.1111/1467-8659.1530057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2967

F. Ganovelli, P. Cignoni, C. Montani, and R. Scopigno, A Multiresolution Model for Soft Objects Supporting Interactive Cuts and Lacerations, Computer Graphics Forum, vol.19, issue.3, pp.271-82, 2000.
DOI : 10.1111/1467-8659.00419

G. Farin, Geometric modeling: algorithms and new trends, 1987.

J. Shewchuk, Constrained Delaunay tetrahedralizations and provably good boundary recovery, Eleventh international meshing roundtable, pp.193-204, 2002.

S. Cheng and S. Poon, Graded conforming Delaunay tetrahedralization with bounded radius-edge ration, Proceedings of the fourteenth annual ACM?SIAM symposium on discrete algorithms, pp.295-304, 2003.

X. Li, Spacing control and sliver-free Delaunay mesh, Proceedings of the ninth international meshing roundtable, pp.295-306, 2000.

M. Murphy, D. Mount, and C. Gable, A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION, Proceedings of the eleventh annual symposium on discrete algorithms, pp.67-74, 2000.
DOI : 10.1142/S0218195901000699

R. Radovitzky and M. Ortiz, Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation, Computer Methods in Applied Mechanics and Engineering, vol.187, issue.3-4, pp.543-69, 2000.
DOI : 10.1016/S0045-7825(99)00339-4

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=10.1.1.41.2243

A. Fuchs, Automatic grid generation with almost regular Delaunay tetrahedra, Proceedings of the seventh international meshing roundtable, pp.133-181, 1998.
DOI : 10.1002/(sici)1097-0207(19971230)40:24<4595::aid-nme274>3.0.co;2-e

N. Molino, R. Bridson, J. Teran, and R. Fedkiw, A crystalline, red green strategy for meshing highly deformable objects with tetrahedra, Twelfth international meshing roundtable, pp.103-117, 2003.

R. Perucchio, M. Saxena, and A. Kela, Automatic mesh generation from solid models based on recursive spatial decompositions, International Journal for Numerical Methods in Engineering, vol.19, issue.11, pp.2469-501, 1989.
DOI : 10.1002/nme.1620281102

W. Schroeder and M. Shephard, A combined octree/delaunay method for fully automatic 3-D mesh generation, International Journal for Numerical Methods in Engineering, vol.20, issue.1, pp.37-55, 1990.
DOI : 10.1002/nme.1620290105

L. Chew, Constrained Delaunay triangulations, Proceedings of the third annual symposium on Computational geometry , SCG '87, pp.97-108, 1989.
DOI : 10.1145/41958.41981

R. Klein, Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain, CAD Systems Development, pp.313-339, 1995.
DOI : 10.1007/978-3-642-60718-9_22

D. Lee and A. Lin, Generalized delaunay triangulation for planar graphs, Discrete & Computational Geometry, vol.3, issue.3, pp.201-218, 1986.
DOI : 10.1007/BF02187695

E. U. Scho¨nhardtscho¨nhardt and . ¨-ber-die-zerlegung-von-dreieckspolyedern-in-tetraeder, ???ber die Zerlegung von Dreieckspolyedern in Tetraeder, Mathematische Annalen, vol.98, issue.1, pp.309-321, 1928.
DOI : 10.1007/BF01451597

H. Edelsbrunner and E. Mu¨ckemu¨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

M. Shephard and M. Georges, Automatic three-dimensional mesh generation by the finite octree technique, International Journal for Numerical Methods in Engineering, vol.20, issue.4, pp.709-758, 1991.
DOI : 10.1002/nme.1620320406

J. Cavendish, D. Field, and W. Frey, An apporach to automatic three-dimensional finite element mesh generation, International Journal for Numerical Methods in Engineering, vol.3, issue.2, pp.329-376, 1985.
DOI : 10.1002/nme.1620210210

J. Bentley, B. Weide, and A. Yao, Optimal Expected-Time Algorithms for Closest Point Problems, ACM Transactions on Mathematical Software, vol.6, issue.4, pp.563-80, 1980.
DOI : 10.1145/355921.355927
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.410.1733

T. Fang and L. Piegl, Delaunay triangulation using a uniform grid, IEEE Computer Graphics and Applications, vol.13, issue.3, pp.36-47, 1993.
DOI : 10.1109/38.210490

A. Bowyer, Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-168, 1981.
DOI : 10.1093/comjnl/24.2.162
URL : http://comjnl.oxfordjournals.org/cgi/content/short/24/2/162

L. Kenneth, . Clarkson, and W. Peter, Applications of random sampling in computational geometry II, Discrete & Computational Geometry, vol.4, issue.1, pp.387-421, 1989.

D. Watson, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, The Computer Journal, vol.24, issue.2, pp.167-72, 1981.
DOI : 10.1093/comjnl/24.2.167

L. Freitag and O. Carl, A comparison of tetrahedral mesh improvement techniques, Proceedings of the fifth international meshing roundtable, pp.87-100, 1996.
DOI : 10.2172/414383

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

B. Joe, Three-Dimensional Triangulations from Local Transformations, SIAM Journal on Scientific and Statistical Computing, vol.10, issue.4, pp.718-759, 1989.
DOI : 10.1137/0910044