Asymptotic number of triangulations with vertices in $\Z^2$

by S.Yu. Orevkov

Let $\T_n^2$ be the set of all triangulations of the square $[0,n]^2$ with all the vertices belonging to $\Z^2$. We show that $C n^2 < \log\Card\T_n^2 < D n^2$.