Counting Plane Graphs with Exponential Speed-Up

DOI10.1007/978-3-642-19391-0_3zbMath1277.05122OpenAlexW67063475MaRDI QIDQ3003469

Andreas Razen, Ermo Welzl

Publication date: 27 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19391-0_3

zbMATH Keywords

triangulationscountingconstrained Delaunay triangulationplane graphsedge flipscrossing-free configurations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Convex Polygons in Geometric Triangulations ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Counting triangulations and other crossing-free structures via onion layers

Cites Work

• Unnamed Item
• Counting triangulations of planar point sets
• Generalized Delaunay triangulation for planar graphs
• Analytic combinatorics of non-crossing configurations
• An efficient algorithm for enumeration of triangulations
• A better upper bound on the number of triangulations of a planar point set
• Reverse search for enumeration
• On the number of plane geometric graphs
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Crossing-Free Subgraphs
• Fast enumeration algorithms for non-crossing geometric graphs

This page was built for publication: Counting Plane Graphs with Exponential Speed-Up