Complexity of the delaunay triangulation of points on surfaces the smooth case, Proceedings of the nineteenth conference on Computational geometry , SCG '03 ,
DOI : 10.1145/777792.777823
The effect of noise on the number of extreme points, Research Report, vol.7134, pp.201-210, 2003. ,
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
Computational Geometry Algorithms Library ,
Extreme Points Under Random Noise, Proc. 12th European Sympos. Algorithms, pp.264-274, 2004. ,
DOI : 10.1007/978-3-540-30140-0_25
Improved Bounds on the Union Complexity of Fat Objects, Discrete & Computational Geometry, vol.9, issue.1, pp.127-14010, 2008. ,
DOI : 10.1007/s00454-007-9029-7
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
The expected number of k-faces of a Voronoi diagram. Internat, J. Comput. Math, vol.26, issue.593, pp.13-2110, 1993. ,
Nice point sets can have nasty Delaunay triangulations. Discrete and Computational Geometry, pp.109-13210, 2003. ,
Silhouette of a random polytope, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00841374
Limit Theorems of Probability Theory Sequence of Independent Random Variables Number 4 in Oxford studies in probability, 1995. ,
Sur l'enveloppe convex des nuages de points aleatoires dans R n, J. Appl. Probab, vol.7, pp.35-48, 1970. ,
DOI : 10.2307/3212146
Smoothed analysis of algorithms, Journal of the ACM, vol.51, issue.3, pp.385-463, 2004. ,
DOI : 10.1145/990308.990310
Smoothed analysis: an attempt to explain the behavior of algorithms in practice, Commun. ACM, vol.52, issue.10, pp.76-84, 2009. ,