P. Aubry, F. Rouillier, and M. Safey-el-din, Real solving for positive dimensional systems, Journal of Symbolic Computation, vol.34, issue.6, pp.543-560, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100982

B. Bank, M. Giusti, J. Heintz, and L. Pardo, Generalized polar varieties: Geometry and algorithms, Journal of Complexity, vol.21, issue.4, pp.377-412, 2005.

S. Basu, R. Pollack, and M. Roy, Computing roadmaps of semi-algebraic sets on a variety, Journal of the AMS, vol.3, issue.1, pp.55-82, 1999.

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01083587

J. Canny, The complexity of robot motion planning, 1987.

J. Canny, Computing roadmaps in general semi-algebraic sets, The computer Journal, 1993.

J. Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.

J. Faugère, A new efficient algorithm for computing Gröbner without reduction to zero (F5), Proceedings of ISSAC 2002, pp.75-83, 2002.

M. Giusti, K. Hägele, J. Heintz, J. Morais, J. Montaña et al., Lower bounds for Diophantine approximation, Proceedings of MEGA'96, vol.117, pp.277-317, 1997.

M. Giusti, J. Heintz, J. Morais, J. Morgenstern, and L. Pardo, Straight-line programs in geometric elimination theory, Journal of Pure and Applied Algebra, vol.124, pp.101-146, 1998.

M. Giusti, J. Heintz, J. Morais, and L. Pardo, When polynomial equation systems can be solved fast?, Proceedings of AAECC-11, vol.948, pp.205-231, 1995.

M. Giusti, G. Lecerf, and B. Salvy, A Gröbner free alternative for polynomial system solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.

L. Gournay and J. Risler, Construction of roadmaps in semi-algebraic sets, Appl. Alg. Eng. Comm. Comp, vol.4, issue.4, pp.239-252, 1993.

D. Grigoriev and N. , Vorobjov Counting connected component of a semi-algebraic set in subexponential time, Comput. Complexity, vol.2, issue.2, pp.133-186, 1992.

J. Heintz, M. Roy, and P. Solerno, Single exponential path finding in semi-algebraic sets II: The general case. Algebraic geometry and its applications, collections of papers from Abhyankar's 60-th birthday conference, 1994.

G. Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Journal of Complexity, vol.19, issue.4, pp.564-596, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00186727

F. Rouillier, Solving zero-dimensional systems through the rational univariate representation, Journal of Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.5, pp.433-461, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00098872

M. Safey-el-din and É. Schost, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, Proceedings of ISSAC 2003, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099649

M. Safey-el-din and P. Trébuchet, Strong bi-homogeneous Bézout theorem and its use in effective real algebraic geometry, 2005.

J. Schwarz and M. Sharir, On the piano mover's problem II: General techniques for computing topological properties of real algebraic manifolds, Adv. Appl. Math, vol.4, pp.298-351, 1983.