A better upper bound on the number of triangulations of a planar point set
| dc.creator | Santos, Francisco | |
| dc.creator | Seidel, Raimund | |
| dc.date | 2002-04-03 | |
| dc.date | 2002-04-18 | |
| dc.date.accessioned | 2026-07-07T04:47:25Z | |
| dc.date.available | 2026-07-07T04:47:25Z | |
| dc.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$. | |
| dc.description | 6 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0204045 | |
| dc.identifier | http://arxiv.org/abs/math/0204045 | |
| dc.identifier | J. Combin. Theory Ser. A, 102:1 (2003), 186-193 | |
| dc.identifier | doi:10.1016/S0097-3165(03)00002-5 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63710 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C10 | |
| dc.title | A better upper bound on the number of triangulations of a planar point set | |
| dc.type | text |