Cutting Algebraic Curves into Pseudo-segments and Applications
  We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments. This extends a similar (and slightly better) bound for pseudo-circles due to Marcus and Tardos. Our result is based on a technique of Ellenberg, Solymosi and Zahl that transforms arrangements of plane curves into arrangements of space curves, so that lenses (pairs of subarcs of the curves that intersect at least twice) become vertical depth cycles. We then apply a variant of a technique of Aronov and Sharir to eliminate these depth cycles by making a small number of cuts, which corresponds to a small number of cuts to the original planar arrangement of curves. After these cuts have been performed, the resulting curves form a collection of pseudo-segments.   Our cutting bound leads to new incidence bounds between points and constant-degree algebraic curves. The conditions for these incidence bounds are slightly stricter than those for the current best-known bound of Pach and Sharir; for our result to hold, the curves must be algebraic and of bounded maximum degree, while Pach and Sharir's bound only imposes weaker, purely topological constraints on the curves. However, when our conditions hold, the new bounds are superior for almost all ranges of parameters. We also obtain new bounds on the complexity of a single level in an arrangement of constant-degree algebraic curves, and a new bound on the complexity of many marked faces in an arrangement of such curves. 
Micha Sharir and Joshua Zahl
math.CO cs.CG