Asymptotic number of triangulations with vertices in Z^2
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\).
- On counting triangulations in d dimensions
- The asymptotic number of rooted 2-connected triangular maps on a surface
- Asymptotic enumeration of convex polygons
- ON THE NUMBER OF TRIANGULATION SIMPLEXES
- scientific article; zbMATH DE number 1409186
- The Number of Triangulations on Planar Point Sets
- Asymptotic structure of graphs with the minimum number of triangles
- On numbers of pseudo-triangulations
- An upper bound for the number of planar lattice triangulations
- The distinguishing numbers of triangulations on the projective plane
- Triangulations and lattice points
- An upper bound for the number of planar lattice triangulations
- Random lattice triangulations: structure and algorithms
- Equilateral Convex Triangulations of \mathbb R P^2 with Three Conical Points of Equal Defect
- Counting lattice triangulations: Fredholm equations in combinatorics
- Asymptotics of the number of primitive lattice triangulations of rectangles of width 4 and 5
This page was built for publication: Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284484)
