Title of article
A better upper bound on the number of triangulations of a planar point set
Author/Authors
Santos، نويسنده , , Francisco and Seidel، نويسنده , , Raimund، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
186
To page
193
Abstract
We show that a point set of cardinality n in the plane cannot be the vertex set of more than O(59nn−6) straight-edge triangulations of its convex hull. This improves the previous upper bound of 276.75n+O(log(n)).
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530781
Link To Document