Counting crossing-free structures

DOI10.1145/2261250.2261259zbMath1293.05059OpenAlexW1992578069MaRDI QIDQ2874565

Saurabh Ray, Karl Bringmann, Radu Curticapean, Victor Alvarez

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2261250.2261259

zbMATH Keywords

triangulationscountingparameterized complexityonion layers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ Convex Polygons in Geometric Triangulations ⋮ Parameterized analysis and crossing minimization problems ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Connecting the dots (with minimum crossings) ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Counting triangulations and other crossing-free structures via onion layers

This page was built for publication: Counting crossing-free structures