95 search results - page 13 / 19 » A rational quartic B |
106
Voted
JDA
2008
14 years 11 months ago
2008
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (...
CAGD
2004
14 years 11 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
MOC
1998
14 years 11 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
IJACTAICIT
2010
14 years 6 months ago
2010
A real-time path generation method with Non Uniform Rational B Spline(NURBS) technology in the Computer Aided Design(CAD) field is presented and realized in a five-axis Computer N...
108
click to vote
JSC
2011
14 years 2 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...