Algorithms and identities for (q,h)-Bernstein polynomials and (q,h)-Bézier curves -- A non-blossoming approach

DOI10.4208/ATA.2016.V32.N4.5zbMATH Open1389.11074OpenAlexW2751426103MaRDI QIDQ5367689FDOQ5367689

Authors: Ilija Jegdić, Jungsook Larson, Plamen Simeonov 

Publication date: 20 October 2017

Published in: Analysis in Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/ata.2016.v32.n4.5

Recommendations

• \(q\)-blossoming: A new approach to algorithms and identities for \(q\)-Bernstein bases and \(q\)-Bézier curves
• Quantum Bernstein bases and quantum Bézier curves
• \(h\)-blossoming: A new approach to algorithms and identities for \(h\)-Bernstein bases and \(h\)-Bézier curves
• \(q\)-Bernstein polynomials and Bézier curves
• Algorithms and identities for Bézier curves via post-quantum blossom

zbMATH Keywords

Bernstein polynomialsMarsden's identityrecursive evaluationBézier curves

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Computer-aided design (modeling of curves and surfaces) (65D17)

Cited In (5)

• \(q\)-Bernstein polynomials and Bézier curves
• Quantum \((q, h)\)-Bézier surfaces based on bivariate \((q, h)\)-blossoming
• On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus. II: De Casteljau algorithm
• On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus. III: Blossoming
• Formulae relating littleq-Jacobi,q-Hahn andq-Bernstein polynomials: application toq-Bézier curve evaluation

This page was built for publication: Algorithms and identities for \((q,h)\)-Bernstein polynomials and \((q,h)\)-Bézier curves -- A non-blossoming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367689)