A better upper bound on the number of triangulations of a planar point set

We show that a point set of cardinality n in the plane cannot be the vertex set of more than O(59nn−6) straight-edge triangulations of its convex hull. This improves the previous upper bound of 276.75n+O(log(n)).