Peeling Sequences

Abstract

Given an n-element point set in the plane, in how many ways can it be peeled off until no point remains? Only one extreme point can be removed at a time. 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?

1. Introduction

Given n points on a line, in how many ways can they be removed, when we are only allowed to remove from one end? We can remove from either end until one point remains, when we have exactly one choice. Consequently, there are two choices at each step except the last one, thus $2^{n-1}$ options.

A set of points in the plane is said to be in a general position if no three of them are collinear. Let P be a set of n points in the plane in general position, labeled by $1,2,\dots ,n$. Consider removing points one by one until no point remains, under the provision that exactly one extreme point (i.e., a convex hull vertex) is removed in the current step. If the points are in a convex position, there are exactly $n!$ options, which is clearly the maximum number of ways to remove n points. What is the minimum number?

A peeling sequence for P is any permutation of $\left[n\right]$ that can be obtained by writing the labels of the points removed one by one. We are interested in the minimum number of such permutations that can be obtained, over all point sets of size n.

Definitions. 

Given an n-element point set P in a general position of the plane, let $g\left(P\right)$ count the number of peeling sequences for P and $g\left(n\right)$ denote the minimum of $g\left(P\right)$ over all n-element point sets P in the general position. It should be clear that $g\left(n\right)$ is an increasing function of n.

Our results. 

To begin, we determine the values of $g(·)$ for the first few small values of n. Trivially, we have $g\left(1\right)=1$, and $g\left(2\right)=2$.

Proposition 1.

The following exact values can be observed.

$$\begin{array}{cc}\hfill g\left(3\right)& =6,\hfill \\ \hfill g\left(4\right)& =18,\hfill \\ \hfill g\left(5\right)& =60,\hfill \\ \hfill g\left(6\right)& =180.\hfill \end{array}$$

We then establish the following bounds (all logarithms are in base 2).

Theorem 1.

Every n-element point set in a general position admits $\Omega \left(3^n\right)$ peeling sequences. On the other hand, there are sets with only $2^{O\left(n\log \log n\right)}$ peeling sequences. Equivalently, the following inequalities are in effect: $g\left(n\right)=\Omega \left(3^n\right)$ and $g\left(n\right)=2^{O\left(n\log \log n\right)}$.

It will be evident from the proof of Theorem 1 that $g\left(n\right)$ is a multiple of 6 for every $n\ge 3$ and that $g\left(n\right)$ satisfies the following recurrence:

$$g\left(n\right)\ge 3·g(n-1),\mathrm{for}n\ge 3.$$

(1)

Let $h\left(n\right)=\log g\left(n\right)$. Then, obviously, $h\left(n\right)=\Omega \left(n\right)$ and $h\left(n\right)=O\left(n\log \log n\right)$.

Related work. 

The concept of “peeling” a convex hull has been associated to dynamic convex hull algorithms and convex hull determination [1]. For a planar point set P, the convex layers of P are the convex polygons obtained by iterating the following procedure: computing its convex hull and removing its vertices from P [2]. The process of the peeling a point set has been shown to be very useful for obtaining robust estimators in statistics [2,3]. A common estimator of a (unidimensional) sample is its arithmetic mean; however, this estimator can be severely affected by outliers. A method that performs better is is to discard the highest and lowest $\alpha$-fraction of the data and take the mean of the remainder. This is the $\alpha$-trimmed mean. The median is the special case $\alpha =1/2$. The higher-dimensional analog of trimming, called “peeling” by Tukey, consists of successively removing extreme points of the convex hull of the data until a certain fixed fraction of the points remains.

A quadratic algorithm for peeling (i.e., for convex layer decomposition) was initially proposed by Shamos [4]. A faster algorithm, running in $O\left(n{\log }^{2}n\right)$, is due to Overmars and Van Leeuwen [1]. Finally, an optimal algorithm, running in $O\left(n\log n\right)$ time, was obtained by Chazelle [2]. In the area of dynamic convex hull algorithms, the latest developments are due to Chan [5]. Computing the convex layers and studying their structure in a random setting have been studied by Dalal [6]. Har-Peled and Lidický [7] have studied the number of steps needed for peeling the integer grid $G_n$ with n points (with, say, $n=k^2$); note that $G_n$ is not in a general position, but the peeling process can be executed on any point set.

It should be noted that while in the discussion above, all the extreme points in a layer are removed in parallel (i.e., at the same time), in our study—of the function $g\left(n\right)$—the extreme points are removed sequentially one by one.

2. Preliminaries

Observation 1.

Let P be any n-element point set. Then, $g\left(P\right)\le n!$.

Proof. 

By definition, any peeling sequence for P is a permutation of $\left[n\right]$, and the upper bound is implied. □

Proof of Proposition 1. 

Let h denote the size of the convex hull of P. The case $n=3$ is clear: there are $3!=6$ permutations, and each of them is a valid peeling sequence. The remaining cases are illustrated in Figure 1.

Let now $n=4$. If the points are in convex position, there are $4!=24$ permutations. If the points are not in convex position, let 4 be the interior point. Then, any permutation that starts with 4 is invalid; however, all remaining $4!-3!=18$ permutations are valid.

Let now $n=5$. If $h\ge 4$, there are at least $4\times g\left(4\right)=72$ permutations. The case $h=3$ yields the smallest number, $24+18+18=60$, of permutations; indeed, removing one of the extreme points yields a convex quadrilateral, while the other two removals can result in a triangle with a point inside.

Finally, let $n=6$. If $h\ge 4$, there are at least $4\times g\left(5\right)=240$ permutations. The case $h=3$ yields the smallest number: $3\times g\left(5\right)=3\times 60=180$ permutations; indeed, removing each of the extreme points may yield the minimizer for $n=5$ discussed above. □

3. Proof of Theorem 1

Lower bound. 

Let P be any n-element point set in general position, where $n\ge 3$. By the assumption, $\mathrm{conv}\left(P\right)$ has at least three extreme vertices, and the removal of each yields a set of $n-1$ points in a general position. Any two peeling sequences resulting from the removal of two different extreme vertices are clearly different. As such, $g(·)$ satisfies the recurrence $g\left(n\right)\ge 3·g(n-1)$. Consequently, $g\left(n\right)=\Omega \left(3^n\right)$. By Proposition 1, we also have $g\left(n\right)\ge 180·3^{n-6}$ for every $n\ge 6$.

Upper bound. 

Here, we prove the upper bound in Theorem 1. Our construction is remotely reminiscent of that in [8] in that it uses long, slightly concave chains of points (vs. long slightly concave chains of unit disks). The long chains of disks in [8] have the effect that the construction is hard to dismantle, and a significant segment of the initial moves are in a certain sense wasted. Similarly, here, the long concave chains of points are very restrictive with respect to the points that can be removed in an initial phase of the removal procedure.

Consider a regular k-gon K with vertex set $P_0$. Replace each side of the k-gon by a circular arc of very large radius R centered in the exterior of K that is incident to the two endpoints of the side. Distribute evenly $a-1$ new points on each arc, where a is a positive integer. Denote by P the resulting set of $n=k+k(a-1)=ka$ points; see Figure 2. Note that $\mathrm{conv}\left(P\right)$ has exactly k extreme points. The key property of the constructed point set P with respect to repeated deletion of points is that this situation persists (apart from a factor of 2) as long as about $n/k$ points remain. This is made precise in the following.

Lemma 1.

Let $P^{\prime }\subset P$ be a subset of points that remains after removing $\left|P\right|-|P^{\prime }|$ points from P (i.e., peeling P according to the rules for that many steps). If $|P^{\prime }|\ge a+2$, then $\mathrm{conv}\left(P^{\prime }\right)$ has at most $2k$ extreme points.

Proof. 

Let C be any fixed chain in P and let $C^{\prime }=C\cap P^{\prime }$. Observe that $C^{\prime }$ consists of a contiguous subchain of the points in C. It suffices to show that $C^{\prime }$ contributes at most two extreme points in $P^{\prime }$. This is clear if $|C^{\prime }|\le 2$, so assume that $|C^{\prime }|\ge 3$. Each concave chain has initially $(a-1)+2=a+1$ points. Since $|P^{\prime }|\ge a+2$, $P^{\prime }$ contains points from at least two different initial concave chains, by construction (recall that R is very large), $\mathrm{conv}\left(P^{\prime }\right)$ has an extreme vertex that does not belong to C and exactly two extreme vertices in $C^{\prime }\subset C$. In either case, $C^{\prime }$ contributes at most two extreme points in $P^{\prime }$, as claimed. □

We return to the upper bound proof. It remains to estimate the number of resulting peeling sequences and set a suitable value for k to minimize the bound. Divide any peeling sequence (of length n) into two subsequences: a prefix subsequence of length $n-n/k-1$ and a suffix subsequence of length $n/k+1$. By Lemma 1, the number of prefix subsequences is bounded from above by ${\left(2k\right)}^{n-n/k-1}$. By Observation 1, the number of suffix subsequences corresponding to a fixed prefix subsequence is bounded from above by $(n/k+1)!$. Consequently, the total number of peeling sequences is bounded from above by the product rule:

$$g\left(n\right)\le {\left(2k\right)}^{n-n/k-1}·\left(\frac{n}{k}+1\right)!.$$

Using a trivial estimate for the factorial $\log n!\le n\log n-n/2$ and taking logarithms yields

$$\begin{array}{cc}\hfill h\left(n\right)& \le \left(n-\frac{n}{k}-1\right)\log \left(2k\right)+\log \left(\left(\frac{n}{k}+1\right)!\right)\hfill \\ \hfill & \le \left(n-\frac{n}{k}\right)\log \left(2k\right)+\frac{n}{k}\log \frac{n}{k}.\hfill \end{array}$$

Setting

$$k=⌈\frac{\log n}{\log \log n}⌉$$

balances the two terms and further yields $h\left(n\right)=O\left(n\log \log n\right)$. This completes the proof of Theorem 1. □

A second proof of the upper bound. 

Here we give another construction with a shorter proof. For every $k\ge 3$, Erdős and Szekeres [9] constructed sets with $n=2^{k-1}$ points in general position containing no subset of size $k+1$ in convex position. Let P be such a set. That is, the largest convex subset of P has at most k points. This implies that once we start peeling P, the convex hull of the current set has never more than k vertices, and so the number of choices at each step is at most k. Consequently, the total number of peeling sequences is bounded from above by $k^n$ (this bound can be somewhat reduced due to fewer choices at the end of the process). Taking logarithms as before yields $h\left(n\right)\le n\log k=O\left(n\log \log n\right)$.

4. Concluding Remarks

Observe that the convex layer decomposition of a point set P (mentioned in Section 1) yields a set of peeling sequences naturally derived from it: remove the points from one layer, one by one, before moving to the next layer. Indeed, this is so, since any point of the layer under removal is still extreme at that step. In general, if there are m layers and their sizes are $h_1,h_2,\dots ,h_m$ counting from outside, where $h_1,\dots ,h_{m-1}\ge 3$, $h_m\ge 1$, and ${\sum }_{i=1}^m{h}_i=n$, then there are $h_1!h_2!\cdots h_m!$ peeling sequences given by the convex layer decomposition.

Apart from the case of points in convex position, the set of peeling sequences corresponding to layer by layer removal of the points is a strict subset of the set of peeling sequences of P. It is worth noting that this subset can be much smaller than the whole set. For example, consider a point set with $n/3$ layers, where each layer is a triangle (and so the point set is the vertex set of $n/3$ nested triangles). Then there are $6^{n/3}=1.817{\dots }^n$ peeling sequences given by the convex layer decomposition, whereas the total number of peeling sequences is $\Omega \left(3^n\right)$ by Theorem 1.

Our estimates on the growth rate of $g\left(n\right)$ are rather loose; indeed, even after taking logarithms of the lower and upper bounds, there is still a gap. According to the bounds we have obtained, it is perfectly possible that $g\left(n\right)$ grows faster than any exponential:

Problem 1.

Is there a constant $a>1$ such that $g\left(n\right)=O\left(a^n\right)$?

Another interesting problem is to improve the trivial lower bound in Theorem 1 (say, increase the base by 1):

Problem 2.

Prove (or disprove) that $g\left(n\right)=\Omega \left(4^n\right)$.