BIT NUMERICAL MATHEMATICS, cilt.48, sa.4, ss.689-700, 2008 (SCI-Expanded)
An a. ne de Casteljau type algorithm to compute q-Bernstein Bezier curves is introduced and its intermediate points are obtained explicitly in two ways. Furthermore we de. ne a tensor product patch, based on this algorithm, depending on two parameters. Degree elevation procedure is studied. The matrix representation of tensor product patch is given and we find the transformation matrix between a classical tensor product Bezier patch and a tensor product q-Bernstein Bezier patch. Finally, q-Bernstein polynomials B(n,m) (f; x, y) for a function f(x, y), (x, y) is an element of [0, 1] x [0, 1] are defined and fundamental properties are discussed.