Asymptotic Number of Triangulations with
โ
S.Yu Orevkov
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 84 KB
Let T 2 n be the set of all triangulations of the square [0, n] 2 with all the vertices belonging to Z 2 . We show that Cn 2 <log Card T 2 n <Dn 2 . ## 1999 Academic Press Triangulations with integral vertices appear in the algebraic geometry. They are used in Viro's method of construction of real