J. D. Boissonnat-et-m, G. Yvinec, and . Algorithmique, Also as Algorithmic Geometry, 1995.

P. L. George, H. Borouchaki-et-e, and . Saltel, Maillage simplicial d'un poly??dre arbitraire, Comptes Rendus Mathematique, vol.338, issue.9, 2002.
DOI : 10.1016/j.crma.2003.12.033

H. Borouchaki, P. L. George, and S. H. Lo, Boundary enforcement by facet splits in Delaunay based mesh generation, 7th Inter. Conf. on Numerical Grid Generation in Computational Field Simulations, pp.203-221, 2000.

B. Chazelle, Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm, SIAM Journal on Computing, vol.13, issue.3, pp.488-507, 1984.
DOI : 10.1137/0213031

B. Chazelle-and-l and . Palios, Triangulating a nonconvex polytope, Discrete & Computational Geometry, vol.66, issue.5, pp.505-526, 1990.
DOI : 10.1007/BF02187807

B. Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, vol.15, issue.3, pp.485-524, 1991.
DOI : 10.1007/BF02574703

C. Hazlewood, Approximating constrained tetrahedrizations, Computer Aided Geometric Design, vol.10, issue.1, pp.67-87, 1993.
DOI : 10.1016/0167-8396(93)90052-5

P. L. George, F. Hecht-and-e, and . Saltel, Automatic mesh generator with specified boundary, Computer Methods in Applied Mechanics and Engineering, vol.92, issue.3, pp.269-288, 1991.
DOI : 10.1016/0045-7825(91)90017-Z

A. Liu, BAIDA How far flipping can go towards 3D conforming/constrained triangulation, in proc

M. Murphy, D. M. Mount, and C. W. Gable, A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION, proc. 11 ¡ £ ¢ ACM-SIAM Symposium on Discrete Algorithms, pp.67-74, 2000.
DOI : 10.1142/S0218195901000699

F. P. Preparata and M. I. Shamos, Computational geometry, an introduction, 1985.

J. Ruppert and R. Seidel, On the difficulty of triangulating three-dimensional Nonconvex Polyhedra, Discrete & Computational Geometry, vol.21, issue.3, pp.227-253, 1992.
DOI : 10.1007/BF02187840

N. P. Weatherill-and-o and . Hassan, Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints, International Journal for Numerical Methods in Engineering, vol.93, issue.12, pp.2005-2039, 1994.
DOI : 10.1002/nme.1620371203

. Unité-de-recherche-inria-rocquencourt-domaine-de-voluceau-rocquencourt-bp, 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 -38330 Montbonnot-St, pp.105-78153, 2004.

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