smoothed complexity of convex hulls by witnesses and collectors
Clicks: 182
ID: 255255
2016
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
5.7
/100
19 views
19 readers
Trending
AI Quality Assessment
Not analyzed
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.
| Reference Key |
devillers2016journalsmoothed
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Olivier Devillers;Marc Glisse;Xavier Goaoc;Rémy Thomasse |
| Journal | canadian journal of infectious diseases and medical microbiology |
| Year | 2016 |
| DOI |
10.20382/jocg.v7i2a6
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.