Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials (Q708299): Difference between revisions

A novel approach to the multi-degree reduction of triangular Bézier patches with a prescribed boundary subset of control points is proposed. This prescribed subset of control points relates to the required continuity of the resulting composite surface. The new solution of the multi-degree reduction of triangular Bézier patches is given in terms of bivariate dual discrete Bernstein polynomials. Recursive properties of bivariate dual discrete Bernstein polynomials play an important role in the efficiency of the proposed algorithm. The complexity of the suggested method is \(O(n^2m^2)\), where \(n\) and \(m\) are the degree of the input and output Bézier surface, respectively. The algorithmic implementation of the suggested method is described in detail and several examples are presented. The given method can be used in computer aided geometric design where degree reduction of Bézier curves and surfaces is one of the important problems.