Add to ORKGIn this note we give two new algorithms for computing a cylindrical algebraic decomposition as well as the topological type of a real algebraic curve that run in time =(n1 6log3 n) and 0(n1 9log3 n) respectively, improving then the running time of the best algorithms known so far for the same problems.Postprint (published version
Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is i...
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrar...
AbstractWe give new positive and negative results, some conditional, on speeding up computational al...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic...
We present a certified and complete algorithm to compute arrangements of real planar algebraic curve...
The computation of the topological shape of a real algebraic plane curve is usually driven by the st...
An algorithm is presented for the geometric analysis of an algebraic curve $f(x,y)=0$ in the real af...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
International audienceAlthough Cylindrical Algebraic Decomposition (CAD) is widely used to study the...
AbstractComputing the topology of an algebraic plane curve C means computing a combinatorial graph t...
AbstractCylindrical algebraic decomposition requires many very time consuming operations, including ...
Abstract. We discuss issues of problem formulation for algorithms in real algebraic ge-ometry, focus...
Abstract. Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algeb...
We consider the problem of computing a representation of the plane graph induced by one (or more) a...
Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is i...
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrar...
AbstractWe give new positive and negative results, some conditional, on speeding up computational al...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic...
We present a certified and complete algorithm to compute arrangements of real planar algebraic curve...
The computation of the topological shape of a real algebraic plane curve is usually driven by the st...
An algorithm is presented for the geometric analysis of an algebraic curve $f(x,y)=0$ in the real af...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
International audienceAlthough Cylindrical Algebraic Decomposition (CAD) is widely used to study the...
AbstractComputing the topology of an algebraic plane curve C means computing a combinatorial graph t...
AbstractCylindrical algebraic decomposition requires many very time consuming operations, including ...
Abstract. We discuss issues of problem formulation for algorithms in real algebraic ge-ometry, focus...
Abstract. Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algeb...
We consider the problem of computing a representation of the plane graph induced by one (or more) a...
Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is i...
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrar...
AbstractWe give new positive and negative results, some conditional, on speeding up computational al...