Crossing edges and faces of line arrangements in the plane

DOI10.1007/S10878-014-9769-2zbMATH Open1333.52022OpenAlexW2016685243MaRDI QIDQ5963637FDOQ5963637

Authors: Rom Pinchasi 

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9769-2

Recommendations

• Crossing by lines all edges of a line arrangement
• On the maximal number of edges of many faces in an arrangement
• A note on the minimum number of red lines needed to pierce the intersections of blue lines
• Tight bounds on a problem of lines and intersections
• Cell-paths in mono- and bichromatic line arrangements in the plane

zbMATH Keywords

edgesfacesline arrangement

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of finite geometries (05B25) Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Configuration theorems in linear incidence geometry (51A20)

Cites Work

• Some combinatorial problems in the plane
• A density version of the Hales-Jewett theorem
• Crossing by lines all edges of a line arrangement

Cited In (6)

• Crossings of complex line segments
• Planar Crossovers
• A note on the minimum number of red lines needed to pierce the intersections of blue lines
• Edge crossings in random linear arrangements
• On the maximal number of edges of many faces in an arrangement
• Crossing by lines all edges of a line arrangement

This page was built for publication: Crossing edges and faces of line arrangements in the plane

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