A better upper bound on the number of triangulations of a planar point set (Q1873821): Difference between revisions

The authors prove that the number of triangulations of an arbitrary finite set \(S\) of points in the Euclidean plane is at most \(59^v\cdot 7^b\cdot {v+b+6 \choose 6}^{-1}\), where \(v\) and \(b\) denote the numbers of points of \(S\) which are in the interior respectively in the boundary of the convex hull of \(S\). After a proof of this estimate, a short survey of related results is presented.