M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 1972.

D. Attali and J. Boissonnat, Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces, Discrete and Computational Geometry, vol.30, issue.3, pp.437-452, 2003.
DOI : 10.1007/s00454-003-2824-x
URL : https://hal.archives-ouvertes.fr/inria-00072355

D. Attali and J. Boissonnat, A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces, Discrete and Computational Geometry, vol.31, issue.3, pp.369-384, 2004.
DOI : 10.1007/s00454-003-2870-4
URL : https://hal.archives-ouvertes.fr/inria-00072135

D. Attali, J. Boissonnat, and A. Lieutier, Complexity of the delaunay triangulation of points on surfaces the smooth case, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.201-210, 2003.
DOI : 10.1145/777792.777823

J. Boissonnat, D. Cohen-steiner, B. Mourrain, G. Rote, and G. Vegter, Meshing of Surfaces, Effective Computational Geometry for Curves and Surfaces, pp.181-229, 2006.
DOI : 10.1007/978-3-540-33259-6_5
URL : https://hal.archives-ouvertes.fr/hal-00488274

F. Cazals and J. Giesen, Delaunay Triangulation Based Surface Reconstruction, Effective Computational Geometry for Curves and Surfaces, pp.231-276, 2006.
DOI : 10.1007/978-3-540-33259-6_6
URL : https://hal.archives-ouvertes.fr/inria-00070609

H. Edelsbrunner, Geometry for modeling biomolecules, WAFR '98: Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective, pp.265-277

J. Erickson, Nice Point Sets Can Have Nasty Delaunay Triangulations, Discrete and Computational Geometry, vol.30, issue.1, pp.109-132, 2003.
DOI : 10.1007/s00454-003-2927-4

J. Erickson, Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?, Discrete & Computational Geometry, vol.33, issue.1, pp.83-115, 2005.
DOI : 10.1007/s00454-004-1089-3
URL : http://arxiv.org/pdf/cs/0110030v1.pdf

M. Golin and N. H. , On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes, Computational Geometry, vol.25, issue.3, pp.197-231, 2003.
DOI : 10.1016/S0925-7721(02)00123-2

M. Golin and H. Na, The probabilistic complexity of the Voronoi diagram of points on a polyhedron, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, 2002.
DOI : 10.1145/513400.513426

A. Rényi and R. Sulanke, ???ber die konvexe H???lle von n zuf???llig gew???hlten Punkten, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.2, issue.1, pp.75-84, 1963.
DOI : 10.1007/BF00535300

C. Tu, W. Wang, and J. Wang, Classifying the nonsingular intersection curve of two quadric surfaces, Proc. of GMP'02 (Geometric Modeling and Processing), pp.23-32, 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