Forbidden Configurations in Discrete Geometry

DOI10.1017/9781108539180zbMath1417.52001OpenAlexW2783939054MaRDI QIDQ4569672

David Eppstein

Publication date: 27 June 2018

Full work available at URL: https://doi.org/10.1017/9781108539180

zbMATH Keywords

computational complexityinequalitiescombinatorial enumerationforbidden configurations

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Other designs, configurations (05B30) Erd?s problems and related topics of discrete geometry (52C10) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Related Items (10)

The extensible no-three-in-line problem ⋮ Unnamed Item ⋮ Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ 4-connected triangulations on few lines ⋮ Line and plane cover numbers revisited ⋮ Counting polygon triangulations is hard ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Geometric dominating sets -- a minimum version of the no-three-in-line problem

This page was built for publication: Forbidden Configurations in Discrete Geometry