Lattice Triangulations How many triangulations exist for a 6 × 6 grid?

In this paper we describe two different methods for counting the number of triangulations for planar point sets. The first method introduced by Kaibel and Ziegler [1] is shown to be effective only in the special case of planar grids of size m × n, denoted by Pm,n: = {0, 1,..., m}×{0, 1,..., n}. The second one, the path of a triangulation method du