A better upper bound on the number of triangulations of a planar point set
Combinatorics
2007-05-23 v2
Abstract
We show that a point set of cardinality in the plane cannot be the vertex set of more than straight-edge triangulations of its convex hull. This improves the previous upper bound of .
Cite
@article{arxiv.math/0204045,
title = {A better upper bound on the number of triangulations of a planar point set},
author = {Francisco Santos and Raimund Seidel},
journal= {arXiv preprint arXiv:math/0204045},
year = {2007}
}
Comments
6 pages, 1 figure