77 citations · 318 across the 57 of their papers we have counts for
1 paper · 1 filter
Boris Aronov, Dmitriy Drusvyatskiy
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(λ_s(n)), O(λ_…