The Number of Crossing Free Configurations on Finite Point Sets in the Plane

DOI10.1007/11944836_4MaRDI QIDQ5385969zbMATH OpenOpenAlexFDO

Authors Emo Welzl

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_4

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Number of crossing-free geometric graphs vs. Triangulations
• Counting crossing-free structures
• Counting and enumerating crossing-free geometric graphs
• Counting and enumerating crossing-free geometric graphs
• Counting plane graphs with exponential speed-up

Cited in

(11)

• The complexity of detecting crossingfree configurations in the plane
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• The probability that the number of points on a complete intersection is squarefree
• On the number of plane geometric graphs
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
• Random triangulations of planar points sets
• scientific article; zbMATH DE number 11985 (Why is no real title available?)
• Counting and enumerating crossing-free geometric graphs
• Number of crossing-free geometric graphs vs. Triangulations
• Counting and enumerating crossing-free geometric graphs
• Crossing-free segments and triangles in point configurations

This page was built for publication: The Number of Crossing Free Configurations on Finite Point Sets in the Plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385969)