An Upper Bound for the Number of Planar Lattice Triangulations

Abstract

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).

4 pages, 3 figures

Cited by in corpus (1)

• Counting Triangulations of Configurations