smoothed complexity of convex hulls by witnesses and collectors
Clicks: 253
ID: 255255
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
253 views
49 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #8 of 19 articles by views in canadian journal of infectious diseases and medical microbiology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
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.