Smoothed complexity of convex hulls by witnesses and collectors
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.
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2016-02-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/265 |