Computing roadmaps of semi-algebraic sets (extended abstract)

Authors:
S. Basu;R. Pollack;M.-F. Roy
Affiliations:
Department of Computer Science, Courant Institute, New York;Department of Mathematics, Courant Institute, New York;Department of Mathematics, Université de Rennes, Campus de Beaulieu, 35042 Rennes cedex, France
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Cited References

Computer algebra handbook
Pianos are not flat: rigid motion planning in three dimensions

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Shape Matching by Random Sampling

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Hi-index	0.00