5 citations · 11 across the 4 of their papers we have counts for
4 papers
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of th…
On the Complexity of Solving a Bivariate Polynomial System
Pavel Emeliyanenko, Michael Sagraloff
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method wh…
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…
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method…