In the algebraic subfield of after assay the de Boor's algorithm is a fast and numerically abiding algorithm for evaluating spline curves in B-spline form. It is a generalization of the de Casteljau's algorithm for Bézier curves. The algorithm was devised by Carl R. de Boor. Simplified, potentially faster variants of the de Boor algorithm accept been created but they ache from analogously lower stability
Tuesday, 22 May 2012
Introduction
The accepted ambience is as follows. We would like to assemble a ambit whose appearance is declared by a arrangement of p credibility , which plays the role of a ascendancy polygon. The ambit can be declared as a action of one constant x. To canyon through the arrangement of points, the ambit accept to amuse . But this is not absolutely the case: in accepted we are annoyed that the ambit "approximates" the ascendancy polygon. We accept that u0, ..., up-1 are accustomed to us forth with .
One access to break this botheration is by splines. A spline is a ambit that is a piecewise nth amount polynomial. This agency that, on any breach ui, ui+1), the ambit accept to be according to a polynomial of amount at a lot of n. It may be according to altered polynomials on altered intervals. The polynomials accept to be synchronized: if the polynomials from intervals ui-1, ui) and ui, ui+1) accommodated at the point ui, they accept to accept the aforementioned amount at this point and their derivatives accept to be according (to ensure that the ambit is smooth).
De Boor's algorithm is an algorithm which, accustomed u0, ..., up-1 and , finds the amount of spline ambit at a point x. It uses O(n2) operations. Notice that the active time of the algorithm depends alone on amount n and not on the amount of credibility p.
Introduction
Cubic B-splines with compatible knot-vector is the a lot of frequently acclimated anatomy of B-spline. The aggregate action can calmly be precalculated, and is according for anniversary articulation in this case. Put in matrix-form, it is:
for
Outline of the algorithm
Suppose we wish to appraise the spline ambit for a constant amount . We can accurate the ambit as
where3 and
Due to the spline belt property,
So the amount is bent by the ascendancy credibility ; the added ascendancy credibility accept no influence. De Boor's algorithm, declared in the next section, is a action which calmly calculates the announcement for .
Subscribe to:
Posts (Atom)