New algorithms and bounds for halving pseudolines

DOI10.1016/j.dam.2021.05.029zbMath1494.05077OpenAlexW4206815148MaRDI QIDQ5918765

Mohammadreza Haghpanah, Sergey Bereg

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.029

zbMATH Keywords

halving linepartial allowable sequence

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• Coding and counting arrangements of pseudolines
• Semispaces of configurations, cell complexes of arrangements
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
• The number of small semispaces of a finite set of points in the plane
• Axioms and hulls
• Circles through two points that always enclose many points
• On the number of arrangements of pseudolines
• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
• On halving line arrangements
• Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
• A lower bound for the rectilinear crossing number
• The maximum number of halving lines and the rectilinear crossing number of for
• New Lower Bounds for the Number of Pseudoline Arrangements
• Abstract order type extension and new results on the rectilinear crossing number
• Computational search of small point sets with small rectilinear crossing number