The complexity of robot motion planning
The complexity of robot motion planning
Mathematics for computer algebra
Mathematics for computer algebra
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Robust Proximity Queries in Implicit Voronoi Diagrams
Robust Proximity Queries in Implicit Voronoi Diagrams
Computing the minimum diameter for moving points: an exact implementation using parametric search
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient exact geometric computation made easy
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Computer algebra handbook
Reliable Implementation of Real Number Algorithms: Theory and Practice
A faster algorithm for computing motorcycle graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |