International audienceThis paper presents an improved algebraic pruning method for point projection for Bézier curves. It first turns the point projection into a root finding problem, and provides a simple but easily overlooked method to avoid finding invalid roots which is obviously irrelative to the closest point. The continued fraction method and its expansion are utilized to strengthen its robustness. Since NURBS curves can be easily turned into Bézier form, the new method also works with NURBS curves. Examples are presented to illustrate the efficiency and robustness of the new method
AbstractThe error analysis of Farin's and Forrest's algorithms for generating an approximation of de...
AbstractGiven a real valued function f(X,Y), a box region B0⊆R2 and ε>0, we want to compute an ε-iso...
AbstractA functionF(x,y,t)that assigns to each parametertan algebraic curveF(x,y,t)=0is called a mov...
International audienceThis paper presents an improved algebraic pruning method for point projection ...
AbstractThis paper presents a new algorithm for solving a system of polynomials, in a domain of Rn. ...
We present two integer-only algorithms to be used in tandem for rendering cubic functions and parame...
International audienceWe describe a new algorithm for the visualisation of implicit algebraic curves...
AbstractWe have designed a new symbolic–numeric strategy for computing efficiently and accurately fl...
We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of ratio...
National audienceModelling polynomial curves or arcs with Bezier curves can be seen as a basis conve...
International audienceThis paper presents a new algorithm for solving a system of polynomials, in a ...
This paper represents a new approach that can recover the control points for wide variety of 3rd ord...
AbstractWe give a general treatment of the problem of converting a curve expressed in a B-spline exp...
Drawing the figure of the real zeros of a bivariate polynomial, in other words, the graphof a real a...
AbstractRunning error analysis of the corner cutting algorithm for rational Bézier surfaces is carri...
AbstractThe error analysis of Farin's and Forrest's algorithms for generating an approximation of de...
AbstractGiven a real valued function f(X,Y), a box region B0⊆R2 and ε>0, we want to compute an ε-iso...
AbstractA functionF(x,y,t)that assigns to each parametertan algebraic curveF(x,y,t)=0is called a mov...
International audienceThis paper presents an improved algebraic pruning method for point projection ...
AbstractThis paper presents a new algorithm for solving a system of polynomials, in a domain of Rn. ...
We present two integer-only algorithms to be used in tandem for rendering cubic functions and parame...
International audienceWe describe a new algorithm for the visualisation of implicit algebraic curves...
AbstractWe have designed a new symbolic–numeric strategy for computing efficiently and accurately fl...
We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of ratio...
National audienceModelling polynomial curves or arcs with Bezier curves can be seen as a basis conve...
International audienceThis paper presents a new algorithm for solving a system of polynomials, in a ...
This paper represents a new approach that can recover the control points for wide variety of 3rd ord...
AbstractWe give a general treatment of the problem of converting a curve expressed in a B-spline exp...
Drawing the figure of the real zeros of a bivariate polynomial, in other words, the graphof a real a...
AbstractRunning error analysis of the corner cutting algorithm for rational Bézier surfaces is carri...
AbstractThe error analysis of Farin's and Forrest's algorithms for generating an approximation of de...
AbstractGiven a real valued function f(X,Y), a box region B0⊆R2 and ε>0, we want to compute an ε-iso...
AbstractA functionF(x,y,t)that assigns to each parametertan algebraic curveF(x,y,t)=0is called a mov...