Highly Influenced

@inproceedings{Basu1996ComputingRO, title={Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract)}, author={Saugata Basu and Richard Pollack and Marie-Françoise Roy}, booktitle={STOC}, year={1996} }

- Published 1996 in STOC
DOI:10.1145/237814.237857

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.