Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles (Q809287): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles |
scientific article |
Statements
Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles (English)
0 references
1991
0 references
Using the polar form of the bivariate polynomials F the author constructs a new representation for F and calls it ``B-patch representation''. The B-patches are a generalization of the known Bézier patches and reduce to them for particular choice of the knots. A de Boor-like evaluation algorithm is discribed for the B-patches and their most important properties are discussed.
0 references
de Boor algorithm
0 references
B-patch representation
0 references
Bézier patches
0 references