N. Alon and J. H. Spencer, The Probabilistic Method, 2008.

D. Attali, O. Devillers, and X. Goaoc, The Eect of Noise on the Number of Extreme Points

I. Bárány and D. Larman, Convex bodies, economic cap coverings, random polytopes, Mathematika, vol.35, p.274291, 1988.

I. Bárány and V. Vu, Central limit theorems for Gaussian polytopes. The Annals of Probability, p.15931621, 2007.

F. Cazals and J. Giesen, Delaunay Triangulation Based Surface Reconstruction, Eective Computational Geometry for Curves and Surfaces, p.231276, 2006.
DOI : 10.1007/978-3-540-33259-6_6

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

R. M. Corless, G. H. Gonnet, D. Hare, D. J. Jerey, and D. E. Knuth, On the Lambert W function, Advances in Computational Mathematics, vol.5, issue.1, pp.32935910-1007, 1996.

V. Damerow and C. Sohler, Extreme Points Under Random Noise, Proc. 12th European Sympos. Algorithms, p.264274, 2004.
DOI : 10.1007/978-3-540-30140-0_25

M. Berg, Improved bounds on the union complexity of fat objects, Discrete & Computational Geometry, p.127140, 2008.

O. Devillers, M. Glisse, and X. Goaoc, Complexity analysis of random geometric structures made simpler, Proceedings of the 29th annual symposium on Symposuim on computational geometry, SoCG '13
DOI : 10.1145/2462356.2462362

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

O. Devillers, M. Glisse, and X. Goaoc, Complexity analysis of random geometric structures made simpler, Proceedings of the 29th annual symposium on Symposuim on computational geometry, SoCG '13, p.167176, 2013.
DOI : 10.1145/2462356.2462362

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

O. Devillers, M. Glisse, X. Goaoc, and R. Thomasse, On the smoothed complexity of convex hulls, Symposium on Computational Geometry, p.224239, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01144473

R. Dwyer, The expected number of k-faces of a Voronoi diagram, Computers & Mathematics with Applications, vol.26, issue.5, p.1321, 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, p.109132, 2003.

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

M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2005.
DOI : 10.1017/CBO9780511813603

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 convexe des nuages de points aleatoires dans R n, J. Appl. Probab, vol.7, p.3548, 1970.

M. Reitzner, Random Polytopes, New perspectives in stochastic geometry, p.4576
DOI : 10.1093/acprof:oso/9780199232574.003.0002

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

A. Rényi and R. Sulanke, Über die konvexe Hülle von n zufällig gewählten Punkten I, Z. Wahrsch. Verw. Gebiete, vol.2, p.7584, 1963.

A. Rényi and R. Sulanke, Über die konvexe Hülle von n zufällig gewählten Punkten II, Z. Wahrsch. Verw. Gebiete, vol.3, pp.13814710-1007, 1964.

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

J. J. Sylvester, On a special class of questions on the theory of probabilities, Birmingham British Association Report, pp.89-1865

R. Thomasse, Complexity analysis of random convex hulls. Theses URL https, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01252937