Counting triangulations of planar point sets

zbMath1218.05072MaRDI QIDQ540059

Adam Sheffer, Micha Sharir

Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223107

zbMATH Keywords

triangulationscountingcharging schemescrossing-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (22)

Configurations of non-crossing rays and related problems ⋮ A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ On Compatible Matchings ⋮ Convex Polygons in Geometric Triangulations ⋮ Trapezoidal diagrams, upward triangulations, and prime Catalan numbers ⋮ Crossings in grid drawings ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Colored ray configurations ⋮ On numbers of pseudo-triangulations ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ Counting polygon triangulations is hard ⋮ On compatible matchings ⋮ Counting Plane Graphs with Exponential Speed-Up ⋮ On degrees in random triangulations of point sets ⋮ On the number of higher order Delaunay triangulations ⋮ Unnamed Item ⋮ Monotone paths in geometric triangulations ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Counting triangulations and other crossing-free structures via onion layers

This page was built for publication: Counting triangulations of planar point sets