Dumitrescu, A. and Tóth, Géza (2024) Peeling Sequences. DISCRETE AND COMPUTATIONAL GEOMETRY. ISSN 0179-5376
|
Text
s00454-023-00616-8.pdf - Published Version Download (327kB) | Preview |
Official URL: https://doi.org/10.1007/s00454-023-00616-8
Abstract
Given a set of n labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The answer obviously depends on the point set. If the points are in convex position, there are exactly n! ways, which is the maximum number of ways for n points. But what is the minimum number? It is shown that this number is (roughly) at least 3n and at most 12.29n.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Convexity; Integer sequence; Recursive construction; 52C45; 52C35; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 08:03 |
| Last Modified: | 05 Apr 2024 08:03 |
| URI: | https://real.mtak.hu/id/eprint/191932 |
Actions (login required)
 |
Edit Item |
