Full length article: q-Blossoming: A new approach to algorithms and identities for q-Bernstein bases and q-Bézier curves

  • Authors:
  • Plamen Simeonov;Vasilis Zafiris;Ron Goldman

  • Affiliations:
  • Department of Computer and Mathematical Sciences, University of Houston-Downtown, Houston, TX 77002, United States;Department of Computer and Mathematical Sciences, University of Houston-Downtown, Houston, TX 77002, United States;Department of Computer Science, Rice University, Houston, TX 77251, United States

  • Venue:
  • Journal of Approximation Theory
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a new variant of the blossom, the q-blossom, by altering the diagonal property of the standard blossom. This q-blossom is specifically adapted to developing identities and algorithms forq-Bernstein bases and q-Bezier curves over arbitrary intervals. By applying the q-blossom, we generate 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. We also derive for each q-Bezier curve of degree n, a collection of n! new, affine invariant, recursive evaluation algorithms. Using two of these new recursive evaluation algorithms, we construct a recursive subdivision algorithm for q-Bezier curves.