R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, On the LambertW function, Advances in Computational Mathematics, vol.1, issue.6, pp.329-35910, 1996.
DOI : 10.1007/BF02124750

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

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.57-71, 2010.
DOI : 10.1145/1542362.1542397

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, pp.167-176, 2013.
DOI : 10.1145/2462356.2462362
URL : https://hal.archives-ouvertes.fr/hal-00761171

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

M. Reitzner, Random Polytopes, New perspectives in stochastic geometry, pp.45-76, 2010.
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, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.2, issue.1, pp.75-84, 1963.
DOI : 10.1007/BF00535300

A. Rényi and R. Sulanke, ???ber die konvexe H???lle von n zuf???llig gew???hlten Punkten. II, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.2, issue.2, pp.138-14710, 1964.
DOI : 10.1007/BF00535973

A. Daniel, S. Spielman, and . Teng, Smoothed analysis: Why the simplex algorithm usually takes polynomial time, Journal of the ACM, vol.51, pp.385-463, 2004.