A better upper bound on the number of triangulations of a planar point set
From MaRDI portal
Publication:1873821
DOI10.1016/S0097-3165(03)00002-5zbMath1028.52005arXivmath/0204045OpenAlexW2057690024MaRDI QIDQ1873821
Francisco Santos, Raimund Seidel
Publication date: 27 May 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0204045
Discrete geometry (52C99) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) General convexity (52A99)
Related Items
Configurations of non-crossing rays and related problems ⋮ A lower bound on the number of triangulations of planar point sets ⋮ On the number of plane geometric graphs ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ Universal point sets for 2-coloured trees ⋮ Counting Plane Graphs: Cross-Graph Charging Schemes ⋮ Counting polygon triangulations is hard ⋮ Counting Plane Graphs with Exponential Speed-Up ⋮ Counting triangulations of some classes of subdivided convex polygons ⋮ On the number of pseudo-triangulations of certain point sets ⋮ On degrees in random triangulations of point sets ⋮ On the number of higher order Delaunay triangulations ⋮ On the number of rectangulations of a planar point set ⋮ Unnamed Item ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Minimum number of partial triangulations ⋮ Counting triangulations and other crossing-free structures via onion layers
Cites Work
This page was built for publication: A better upper bound on the number of triangulations of a planar point set