A lower bound on the number of triangulations of planar point sets

Authors:
Oswin Aichholzer;Ferran Hurtado;Marc Noy
Affiliations:
Institute for Software Technology, Graz University of Technology, Inffeldgasse 16b, A-8010 Graz, Austria;Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Venue:
Computational Geometry: Theory and Applications
Year:
2004

Citing 6
Cited 9

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Results on k-sets and j-facets via continuous motion

Proceedings of the fourteenth annual symposium on Computational geometry
The path of a triangulation

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Lower bounds on the number of crossing-free subgraphs of KN

Computational Geometry: Theory and Applications
A better upper bound on the number of triangulations of a planar point set

Journal of Combinatorial Theory Series A
Convexity minimizes pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02

Convexity minimizes pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Abstract order type extension and new results on the rectilinear crossing number

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the number of plane graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Abstract order type extension and new results on the rectilinear crossing number

Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
On the number of pseudo-triangulations of certain point sets

Journal of Combinatorial Theory Series A
Improved upper bounds on the reflexivity of point sets

Computational Geometry: Theory and Applications
On degrees in random triangulations of point sets

Proceedings of the twenty-sixth annual symposium on Computational geometry
Use of the TRIPOD overlay network for resource discovery

Future Generation Computer Systems
On degrees in random triangulations of point sets

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by Ω(2.33n).