On the Number of Plane Geometric Graphs

Analytic combinatorics of non-crossing configurations

Philippe Flajolet, Marc Noy · Discrete Mathematics · 1999 · 166 citations

Mathematical Programming, Engineering, Combinatory Analysis +5

Lower bounds on the number of crossing-free subgraphs of KN

Alfredo Garcı́a, Marc Noy, Javier Tejel · Computational Geometry · 2000 · 111 citations

Geometric Graph Theory, Graph Theory, Structural Graph Theory +6

Enumerating Order Types for Small Point Sets with Applications

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser · Order · 2002 · 109 citations

On the Number of Crossing‐Free Matchings, Cycles, and Partitions

Micha Sharir, Emo Welzl · SIAM Journal on Computing · 2006 · 80 citations

Crossing‐free Straight‐line Embedding, Graph Theory, Matching Technique +9

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

Francisco Santos, Raimund Seidel · Journal of Combinatorial Theory Series A · 2003 · 64 citations · Full text

Geometric Modeling, Geometric Graph Theory, Discrete Geometry +10