33 citations · 59 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2014
On the Complexity of Computing with Planar Algebraic Curves
Alexander Kobel, Michael Sagraloff
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials , $g \in…
cs.SC2011★ 4 cited
Arrangement Computation for Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposit…