A new bivariate basis representation for Bzier-based triangular patches with quadratic complexity
A new class of bivariate bases for the triangular surface construction, based on quadratic and cubic bivariate Bernstein polynomials, is proposed, by extending a model for the univariate basis with linear complexity. This new basis is recursively expressed by its recurrence formulae which are provided, and its important geometric properties are also described. In addition, a recursive algorithm for calculating a point on this triangular surface is recursively defined in the same manner as in the well known de Casteljau algorithm. The main advantage of this model is its recursive algorithm that is proven to construct a triangular surface of degree n n in quadratic computational complexity, O(n2) O ( n 2 ) .
quadratic complexity recurrence formulae recursive algorithm bzier triangular patches