Published in
Computational Geometry Laboratory, Journal of Computational Geometry, (Vol 7), p. No 2 (2016): Special Issue of Selected Papers from SoCG 2015-
DOI: 10.20382/jocg.v7i2a6
Links
Tools
Smoothed complexity of convex hulls by witnesses and collectors
This paper is made freely available by the publisher.
Full text: Download
Data provided by 
Abstract
We present a simple technique for analyzing the size of geometric hypergraphs defined 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.