On computing a set of points meeting every cell defined by a family of polynomials on a variety

Motion planning for multiple robots

Proceedings of the fourteenth annual symposium on Computational geometry

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

Computing Largest Common Point Sets under Approximate Congruence

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms

Cited References

Computer algebra handbook

Approximately matching polygonal curves with respect to the Fréchet distance

Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03

Approximately matching polygonal curves with respect to the Fréchet distance

Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03

Geometric optimization and sums of algebraic functions

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Convex transversals

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Shape matching by random sampling

Theoretical Computer Science

Computing real solutions of polynomial systems via low-rank moment matrix completion

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Geometric optimization and sums of algebraic functions

ACM Transactions on Algorithms (TALG)

Convex transversals

Computational Geometry: Theory and Applications