A base-$8$ upper bound for planar peeling sequences

Source abstract

Let $g(n)$ denote the minimum number of peeling sequences among all $n$-point sets in general position in the plane. Dumitrescu and Tóth proved an exponential upper bound with base $12.29$, and Simon subsequently lowered the base to $9.78$. Using the same recursive construction, we prove $$\begin{equation*} g(n) \le (8+o(1))^n. \end{equation*}$$