Smoothed complexity of convex hulls by witnesses and collectors

Olivier Devillers 1 Marc Glisse 2 Xavier Goaoc 3 Rémy Thomasse 4
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 DATASHAPE - Understanding the Shape of Data
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
3 LIGM - Laboratoire d'Informatique Gaspard-Monge
4 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 dened 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 :
Journal articles
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

vignette.png
vignette.png
https://hal.inria.fr/hal-01285120
Contributor : Olivier Devillers <>
Submitted on : Tuesday, March 8, 2016 - 4:13:15 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:26 PM

Files

265-1014-1-PB.pdf
Publisher files allowed on an open archive

Identifiers

Collections

UPEC-UPEM | INRIA | UNIV-LORRAINE | LIGM | LIGM_MOA | ENPC | PARISTECH | LORIA-ALGO | LORIA | UNIV-PARIS-SACLAY | ESIEE-PARIS | UNIV-COTEDAZUR

Citation

Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors. Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (2), pp.101-144. ⟨http://jocg.org/v7n2p6⟩. ⟨10.20382/jocg.v7i2a6⟩. ⟨hal-01285120⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

799

Files downloads

168

Contact


archive-ouverte@inria.fr