Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

Smoothed complexity of convex hulls by witnesses and collectors

Olivier Devillers 1 Marc Glisse 2 Xavier Goaoc 3 Rémy Thomasse 2 
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Tuesday, November 24, 2015 - 4:44:02 PM
Last modification on : Thursday, January 20, 2022 - 5:29:56 PM
Long-term archiving on: : Saturday, April 29, 2017 - 3:36:48 AM


Files produced by the author(s)


  • HAL Id : hal-01214021, version 2


Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors. [Research Report] 8787, INRIA. 2015, pp.41. ⟨hal-01214021v2⟩



Record views


Files downloads