TY - GEN A1 - Kaibel, Volker A1 - Ziegler, Günter M. T1 - Counting Lattice Triangulations N2 - We discuss the problem to count, or, more modestly, to estimate the number f(m; n) of unimodular triangulations of the planar grid of size m * n. Among other tools, we employ recursions that allow one to compute the (huge) number of triangulations for small m and rather large n by dynamic programming; we show that this computation can be done in polynomial time if m is fixed, and present computational results from our implementation of this approach. We also present new upper and lower bounds for large m and n, and we report about results obtained from a computer simulation of the random walk that is generated by ips. Y1 - 2003 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/11 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-116 ER -