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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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$.
6 pages, 1 figure

Keywords

Combinatorics, 05C10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/63710

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0204045
 http://arxiv.org/abs/math/0204045
 J. Combin. Theory Ser. A, 102:1 (2003), 186-193
 doi:10.1016/S0097-3165(03)00002-5

Collections

arXiv