Further analysis of Peeling Sequences
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918468648960000 |
|---|---|
| author | Simon, Dániel Gábor |
| author_facet | Simon, Dániel Gábor |
| contents | Let $P\subset \R^2$ be a set of $n$ points in general position. A peeling sequence of $P$ is a list of its points, such that if we remove the points from $P$ in that order, we always remove the next point from the convex hull of the remainder of $P$. Using the methodology of Dumitrescu and Tóth \cite{Dumitrescu}, with a more careful analysis, we improve the upper bound on the minimum number of peeling sequences for an $n$ point set in the plane from $12.29^n/100$ to $9.78^n/500$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_03832 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Further analysis of Peeling Sequences Simon, Dániel Gábor Combinatorics 52C35, 52C45 Let $P\subset \R^2$ be a set of $n$ points in general position. A peeling sequence of $P$ is a list of its points, such that if we remove the points from $P$ in that order, we always remove the next point from the convex hull of the remainder of $P$. Using the methodology of Dumitrescu and Tóth \cite{Dumitrescu}, with a more careful analysis, we improve the upper bound on the minimum number of peeling sequences for an $n$ point set in the plane from $12.29^n/100$ to $9.78^n/500$. |
| title | Further analysis of Peeling Sequences |
| topic | Combinatorics 52C35, 52C45 |
| url | https://arxiv.org/abs/2510.03832 |