论文标题
剥离序列
Peeling Sequences
论文作者
论文摘要
鉴于一组$ n $标记的点数在飞机中的一般位置，我们一一删除其所有点。在每个步骤中，删除了其余集合的凸面船体的一个点。通过以几种方式进行该过程？答案显然取决于点集。如果这些点处于凸位，则恰好有$ n！$方式，这是$ n $点的最大方法。但是最低数字是多少？结果表明，这个数字至少是$ 3^n $，最多为$ 12.29^n $。
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 $3^n$ and at most $12.29^n$.
