Forbidden configurations in discrete geometry

DOI10.1017/9781108539180zbMATH Open1417.52001OpenAlexW2783939054MaRDI QIDQ4569672FDOQ4569672

Authors: David Eppstein 

Publication date: 27 June 2018

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

Recommendations

• scientific article; zbMATH DE number 1749054
• Discrete and computational geometry
• scientific article; zbMATH DE number 2109336
• scientific article; zbMATH DE number 1219771
• scientific article; zbMATH DE number 1049272

zbMATH Keywords

computational complexityinequalitiesforbidden configurationscombinatorial enumeration

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)

Cited In (26)

• The parameterized complexity of finding point sets with hereditary properties
• Convex hulls of random order types
• Forbidden k‐Sets in the Plane
• Combinatorial geometry and its algorithmic applications. The Alcalá lectures
• Forbidden families of configurations
• Large forbidden configurations and design theory
• Forbidding intersection patterns between layers of the cube
• Forbidden configurations, discrepancy and determinants
• Pencils of cubics and algebraic curves in the real projective plane
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Forbidden configurations: boundary cases
• Cubic Planar Graphs that cannot be Drawn on few Lines
• Geometrical sets with forbidden configurations
• On some extremal results for order types
• 4-connected triangulations on few lines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting polygon triangulations is hard
• Restrictions of aspherical arrangements
• Forbidden configurations and product constructions
• Bottleneck convex subsets: finding \(k\) large convex sets in a point set
• General forbidden configuration theorems
• The extensible no-three-in-line problem
• Geometric dominating sets -- a minimum version of the no-three-in-line problem
• Line and plane cover numbers revisited
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

This page was built for publication: Forbidden configurations in discrete geometry

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