Recognition: unknown
A better upper bound on the number of triangulations of a planar point set
classification
🧮 math.CO
keywords
boundpointtriangulationsupperbettercannotcardinalityconvex
read the original abstract
We show that a point set of cardinality $n$ in the plane cannot be the vertex set of more than $59^n O(n^{-6})$ straight-edge triangulations of its convex hull. This improves the previous upper bound of $276.75^n$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.