New lower bounds for the number of pseudoline arrangements

DOI10.20382/JOCG.V11I1A3MaRDI QIDQ3303783zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Ritankar Mandal

Publication date 4 August 2020

Full work available at URL https://jocg.org/index.php/jocg/article/download/3093/2820

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• New lower bounds for the number of pseudoline arrangements
• Coding and counting arrangements of pseudolines
• On the number of arrangements of pseudolines
• scientific article; zbMATH DE number 1182898
• An extended lower bound on the number of( k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n

Cited in

(13)

• On the number of arrangements of pseudolines
• An improved bound for joints in arrangements of lines in space
• On the complexity of the \(k\)-level in arrangements of pseudoplanes
• A t_k inequality for arrangements of pseudolines
• On the number of bounding cycles for nonlinear arrangements
• scientific article; zbMATH DE number 7559262 (Why is no real title available?)
• New lower bounds for the number of pseudoline arrangements
• Arrangements of double pseudolines
• New algorithms and bounds for halving pseudolines
• Reconfiguration and enumeration of optimal cyclic ladder lotteries
• Coding and counting arrangements of pseudolines
• An improved lower bound on the number of pseudoline arrangements
• Reconfiguration and enumeration of optimal cyclic ladder lotteries

This page was built for publication: New lower bounds for the number of pseudoline arrangements

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