论文信息 - Computing roadmaps of semi-algebraic sets (extended abstract)

Computing roadmaps of semi-algebraic sets (extended abstract)

We consider a semi-algebraic set S defined by s polynomials of degree d in k variables. We present a new algorithm for computing a semi-algebraic path in S comecting two points if they happen to lie in the same connected component of S. This algorithm, which works in time s~tldo(~z) improves the complexity of the fastest algorithm solving this problem known to this date.

[1] James Renegar. On the computational complexity and geome-try of the first-order theory of the reals , 1992 .

[2] John Canny,et al. The complexity of robot motion planning , 1988 .

[3] BasuSaugata,et al. On the combinatorial and algebraic complexity of quantifier elimination , 1996 .

[4] Robert Hardt,et al. Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings , 1980 .

[5] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[6] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[7] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[8] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[9] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[10] John F. Canny,et al. Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..