Smoothed complexity of convex hulls by witnesses and collectors

Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse

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.

Full Text:

PDF


DOI: http://dx.doi.org/10.20382/jocg.v7i2a6

ISSN: 1920-180X