An Upper Bound for the Number of Planar Lattice Triangulations
Emile E. Anclin · arXiv (Cornell University) · 2002
We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).