Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
\(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves - MaRDI portal

\(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves (Q657437)

From MaRDI portal





scientific article; zbMATH DE number 5998035
Language Label Description Also known as
English
\(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
scientific article; zbMATH DE number 5998035

    Statements

    \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2012
    0 references
    The authors introduce a new variant of the blossom, the \(q\)-blossom, by altering the diagonal property of the standard blossom. The \(q\)-blossom obtained is adapted to developing identities and algorithms for \(q\)-Bernstein bases and \(q\)-Bézier curves over arbitrary intervals. More precisely, by applying the \(q\)-blossom, it is generated several new identities including an explicit formula representing the monomials in terms of the \(q\)-Bernstein basis functions and a \(q\)-variant of Marsden's identity. In addition, for each \(q\)-Bézier curve of degree \(n\), a collection of \(n!\) new affine invariant recursive evaluation algorithms is obtained. Using these algorithms, the authors construct a recursive subdivision algorithm for \(q\)-Bézier curves.
    0 references
    q-blossom
    0 references
    q-Bernstein basis
    0 references
    q-Bézier curve
    0 references
    Marsden's identity
    0 references
    Subdivision
    0 references
    algorithm
    0 references

    Identifiers