A lower bound on the number of triangulations of planar point sets (Q1882855): Difference between revisions

Let \(t(n)\) denote the least number of straight-edge triangulations of any set of \(n\) points in general position in the plane. The main result of this paper shows that \(t(n)\geq 0.092\cdot 2.33^n\) for \(n\geq 1212\). The proof is based on induction and recurrence relations.