Smoothed complexity of convex hulls by witnesses and collectors
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.
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2016-02-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/265 |
| _version_ | 1818020601990742016 |
|---|---|
| author | Olivier Devillers Marc Glisse Xavier Goaoc Rémy Thomasse |
| author_facet | Olivier Devillers Marc Glisse Xavier Goaoc Rémy Thomasse |
| author_sort | Olivier Devillers |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-14T08:07:18Z |
| format | Article |
| id | doaj.art-88365ca8676f4dca8026266b037496fc |
| institution | Directory Open Access Journal |
| issn | 1920-180X |
| language | English |
| last_indexed | 2024-04-14T08:07:18Z |
| publishDate | 2016-02-01 |
| publisher | Carleton University |
| record_format | Article |
| series | Journal of Computational Geometry |
| spelling | doaj.art-88365ca8676f4dca8026266b037496fc2022-12-22T02:04:41ZengCarleton UniversityJournal of Computational Geometry1920-180X2016-02-017210.20382/jocg.v7i2a690Smoothed complexity of convex hulls by witnesses and collectorsOlivier Devillers0Marc Glisse1Xavier Goaoc2Rémy Thomasse3Inria, centre de recherche Nancy Grand Est CNRS, Loria Université de Lorraine, LoriaInria, centre de recherche Saclay Ile-de-France, FranceUniversité Paris Est, LIGM (UMR 8049), Marne la ValléeInria, centre de recherche Sophia Antipolis - MéditerranéeWe 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.http://jocg.org/index.php/jocg/article/view/265 |
| spellingShingle | Olivier Devillers Marc Glisse Xavier Goaoc Rémy Thomasse Smoothed complexity of convex hulls by witnesses and collectors Journal of Computational Geometry |
| title | Smoothed complexity of convex hulls by witnesses and collectors |
| title_full | Smoothed complexity of convex hulls by witnesses and collectors |
| title_fullStr | Smoothed complexity of convex hulls by witnesses and collectors |
| title_full_unstemmed | Smoothed complexity of convex hulls by witnesses and collectors |
| title_short | Smoothed complexity of convex hulls by witnesses and collectors |
| title_sort | smoothed complexity of convex hulls by witnesses and collectors |
| url | http://jocg.org/index.php/jocg/article/view/265 |
| work_keys_str_mv | AT olivierdevillers smoothedcomplexityofconvexhullsbywitnessesandcollectors AT marcglisse smoothedcomplexityofconvexhullsbywitnessesandcollectors AT xaviergoaoc smoothedcomplexityofconvexhullsbywitnessesandcollectors AT remythomasse smoothedcomplexityofconvexhullsbywitnessesandcollectors |