77 citations · 318 across the 57 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CG2011★ 3 cited
Complexity of a Single Face in an Arrangement of s-Intersecting Curves
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(λ_…
math.OC2011
The dimension of semialgebraic subdifferential graphs
Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis
Examples exist of extended-real-valued closed functions on whose subdifferentials (in the standard, limiting sense) have large graphs. By contrast, if such a function i…