smoothed complexity of convex hulls by witnesses and collectors
Current Language EN
English English Türkçe Türkçe Español Español Português Português Pусский Pусский Filipino Filipino Tiếng Việt Tiếng Việt हिन्दी हिन्दी العربية العربية বাংলা বাংলা Deutsch Deutsch 中文 中文

smoothed complexity of convex hulls by witnesses and collectors

;Olivier Devillers;Marc Glisse;Xavier Goaoc;Rémy Thomasse
canadian journal of infectious diseases and medical microbiology 2016 Vol. 7 pp. -
166
devillers2016journalsmoothed

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.

Keywords

computer softwareanalysis

Access

DOI:
10.20382/jocg.v7i2a6
URL:
http://jocg.org/index.php/jocg/article/view/265

Citation

ID: 255255
Ref Key: devillers2016journalsmoothed
Use this key to autocite in SciMatic or Thesis Manager

References

References

No Bibliography

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
255255
Unique Identifier:
10.20382/jocg.v7i2a6
Network:
Scimatic Chain (ID: 481)
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet
Gas fees required in SCI Coins
Buy SCI

Saymatik Web3.0 Wallet

Google Play
App Store