On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Computing the minimum distance between a point and a NURBS curve
Computer-Aided Design
Computing the Hausdorff distance between two B-spline curves
Computer-Aided Design
Direct manipulation of free-form deformation using curve-pairs
Computer-Aided Design
| Hi-index | 0.00 |