Smoothed complexity of convex hulls by witnesses and collectors

Authors

  • Olivier Devillers Inria, centre de recherche Nancy Grand Est CNRS, Loria Université de Lorraine, Loria
  • Marc Glisse Inria, centre de recherche Saclay Ile-de-France, France
  • Xavier Goaoc Université Paris Est, LIGM (UMR 8049), Marne la Vallée
  • Rémy Thomasse Inria, centre de recherche Sophia Antipolis - Méditerranée

DOI:

https://doi.org/10.20382/jocg.v7i2a6

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.

Downloads

Download data is not yet available.

Downloads

Published

2016-02-22