-Blossoming: A new approach to algorithms and identities for -Bernstein bases and -Bézier curves
Authors:
- Plamen SimeonovPSPlamen Simeonov
- Vasilis ZafirisVZVasilis Zafiris
- Ron GoldmanRGRon Goldman
- 1 January 2012
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 164 (1) , 77-104
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A survey of results on the q-Bernstein polynomialsIMA Journal of Numerical Analysis, 2009
- Approximation properties for generalized q-Bernstein polynomialsJournal of Mathematical Analysis and Applications, 2009
- A generalization of rational Bernstein–Bézier curvesBIT Numerical Mathematics, 2007
- Generalized Bernstein PolynomialsBIT Numerical Mathematics, 2004
- A de Casteljau algorithm for generalized Bernstein polynomialsBIT Numerical Mathematics, 1997
- Shape parameter deletion for Pólya curvesNumerical Algorithms, 1991
- Recursive polynomial curve schemes and computer-aided geometric designConstructive Approximation, 1990
- Blossoms are polar formsComputer Aided Geometric Design, 1989
- Polya’s Urn Model and Computer Aided Geometric DesignSIAM Journal on Algebraic Discrete Methods, 1985