Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\) (Q1284484)

Let \({\mathcal T}_n^2\) be the set of all triangulations of the square \([0,n]^2\) with all vertices belonging to \(\mathbb{Z}^2\). The author shows that there exist positive constants \(C\), \(D\) such that \(Cn^2<\log\text{Card }{\mathcal T}^2_n< Dn^2\). Let \(A\subset \mathbb{R}^2\) be a finite set and let \({\mathcal T}(A)\) denote the set of triangulations of the convex hull of \(A\) with vertices belonging to \(A\). Then it is conjectured that there exists a constant \(C_1\) such that \(\log\text{Card }{\mathcal T}(A)\leq C_1\text{ Card }A\) for any finite \(A\).