A better upper bound on the number of triangulations of a planar point set

Details A better upper bound on the number of triangulations of a planar point set A better upper bound on the number of triangulations of a planar point set

2002-04-03

arxiv.org/abs/math/0204045v2

J. Combin. Theory Ser. A, 102:1 (2003), 186-193

Mathematics

Combinatorics

6 pages, 1 figure

Scientific paper

10.1016/S0097-3165(03)00002-5

We show that a point set of cardinality $n$ in the plane cannot be the vertex
set of more than $59^n O(n^{-6})$ straight-edge triangulations of its convex
hull. This improves the previous upper bound of $276.75^n$.

Affiliated with

Also associated with

No associations

Rating

A better upper bound on the number of triangulations of a planar point set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A better upper bound on the number of triangulations of a planar point set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A better upper bound on the number of triangulations of a planar point set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340439