Further Analysis of Peeling Sequences

Let the 𝑃 ⊂ ℝ 2 be a set of 𝑛 points in general position. A peeling sequence of 𝑃 is a list of its points, such that if we remove points from methodology 𝑃 in that order, we always remove the next point from the convex hull of the remainder of 𝑃. Using the of Dumitrescu and Tóth, with a more careful analysis, we improve the upper bound on the minimum number of peeling sequences for an 𝑛 point set in the plane from 12.29 𝑛 /100 to 9.78 𝑛 /500.