An upper bound for the number of planar lattice triangulations

We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m×n grid:f(m,n)<23mn.In particular, this improves a result of S.Yu. Orevkov [2].