A better upper bound on the number of triangulations of a planar point set (Q1873821)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A better upper bound on the number of triangulations of a planar point set |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better upper bound on the number of triangulations of a planar point set |
scientific article |
Statements
A better upper bound on the number of triangulations of a planar point set (English)
0 references
27 May 2003
0 references
The authors prove that the number of triangulations of an arbitrary finite set \(S\) of points in the Euclidean plane is at most \(59^v\cdot 7^b\cdot {v+b+6 \choose 6}^{-1}\), where \(v\) and \(b\) denote the numbers of points of \(S\) which are in the interior respectively in the boundary of the convex hull of \(S\). After a proof of this estimate, a short survey of related results is presented.
0 references
number of triangulations
0 references
planar point set
0 references
