On the computation of the topology of plane curves

Abstract : Let P be a square free bivariate polynomial of degree at most d and with integer coefficients of bit size at most t. We give a deterministic algorithm for the computation of the topology of the real algebraic curve definit by P, i.e. a straight-line planar graph isotopic to the curve. Our main result is an algorithm for the computation of the local topology in a neighbourhood of each of the singular and critical points of the projection wrt the X axis in $\tilde{O} (d^6 t)$ bit operations where $\tilde{O}$ means that we ignore logarithmic factors in $d$ and $t$. Combined to state of the art sub-algorithms used for computing a Cylindrical Algebraic Decomposition, this result avoids a generic shear and gives a deterministic algorithm for the computation of the topology of the curve in $\tilde{O} (d^6 t + d^7)$ bit operations.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00935728
Contributor : Marie-Francoise Roy <>
Submitted on : Tuesday, May 20, 2014 - 10:06:49 PM
Last modification on : Wednesday, May 15, 2019 - 3:40:47 AM
Long-term archiving on : Wednesday, August 20, 2014 - 12:20:58 PM

File

DiattaRouillierRoy_posted.pdf
Files produced by the author(s)

Identifiers

Citation

Daouda Niang Diatta, Fabrice Rouillier, Marie-Françoise Roy. On the computation of the topology of plane curves. International Symposium on Symbolic and Algebraic Computation, Kobe University, Jul 2014, Kobe, Japan. pp.130-137, ⟨10.1145/2608628.2608670⟩. ⟨hal-00935728v2⟩

Share

Metrics

Record views

1115

Files downloads

321