A lower bound on the number of triangulations of planar point sets (Q1882855): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2004.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160689382 / rank | |||
Normal rank | |||
Revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the number of triangulations of planar point sets |
scientific article |
Statements
A lower bound on the number of triangulations of planar point sets (English)
0 references
1 October 2004
0 references
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.
0 references
triangulations
0 references
counting
0 references
