D. Attali, J. D. 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

D. Attali, O. Devillers, and X. Goaoc, The effect of noise on the number of extreme points, Research Report, vol.7134, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00438409

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

V. Damerow and C. Sohler, Extreme Points Under Random Noise, Proc. 12th Annu
DOI : 10.1007/978-3-540-30140-0_25

. Mark-de-berg, Improved Bounds on the Union Complexity of Fat Objects, Discrete & Computational Geometry, vol.9, issue.1, pp.127-140, 2008.
DOI : 10.1007/s00454-007-9029-7

H. Mark-de-berg, C. P. Haverkort, and . Tsirogiannis, Visibility maps of realistic terrains have linear smoothed complexity, Proceedings of the 25th annual symposium on Computational geometry, SCG '09, pp.163-168, 2009.
DOI : 10.1145/1542362.1542397

R. Dwyer, The expected number of k-faces of a Voronoi diagram, Computers & Mathematics with Applications, vol.26, issue.5, pp.13-21, 1993.
DOI : 10.1016/0898-1221(93)90068-7

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
URL : http://arxiv.org/abs/cs/0103017

M. Glisse, S. Lazard, J. Michel, and M. Pouget, Silhouette of a random polytope, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00841374

V. Petrov, Limit Theorems of Probability Theory Sequence of Independent Random Variables Number 4 in Oxford studies in probability, 1995.

H. Raynaud, Sur l'enveloppe convex des nuages de points aleatoires dans R n, J. Appl. Probab, vol.7, pp.35-48, 1970.

D. A. Spielman and S. Teng, Smoothed analysis of algorithms, Journal of the ACM, vol.51, issue.3, pp.385-463, 2004.
DOI : 10.1145/990308.990310

A. Daniel, S. Spielman, and . Teng, Smoothed analysis: an attempt to explain the behavior of algorithms in practice, Commun. ACM, vol.52, issue.10, pp.76-84, 2009.