Smoothed complexity of convex hulls by witnesses and collectors
Abstract
We present a simple technique for analyzing the size of geometric hypergraphs dened by random point sets. As an application we obtain upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise and related results.
Fichier principal
265-1014-1-PB.pdf (1.13 Mo)
Télécharger le fichier
vignette.png (22.37 Ko)
Télécharger le fichier
Origin : Publisher files allowed on an open archive
Format : Figure, Image
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Loading...