An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points

DOI10.1016/j.endm.2018.06.052zbMath1408.52028OpenAlexW2883136881WikidataQ129517284 ScholiaQ129517284MaRDI QIDQ1792119

Yanyan Li

Publication date: 11 October 2018

Full work available at URL: http://oa.upm.es/57576/

zbMATH Keywords

optimizationcombinatorial geometryrectilinear crossing numberhalving lines

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (1)

New algorithms and bounds for halving pseudolines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
• Point sets with many \(k\)-sets

This page was built for publication: An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points