We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to the previous best upper bound of $43^n$ for the problem.
展开▼
机译：我们研究了一组平面的$ n $个点可以具有的最大三角剖分数量，并表明最多为$ 30 ^ n $。这个新的界限是通过对Sharir和Welzl（2006）的收费方案进行仔细的优化而实现的，该方案导致了该问题的上一个最佳上限$ 43 ^ n $。
展开▼
