Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials

We propose a novel approach to the problem of multi-degree reduction of Bezier triangular patches with prescribed boundary control points. We observe that the solution can be given in terms of bivariate dual discrete Bernstein polynomials. The algorithm is very efficient thanks to using the recursive properties of these polynomials. The complexity of the method is O(n^2m^2), n and m being the degrees of the input and output Bezier surfaces, respectively. If the approximation-with appropriate boundary constraints-is performed for each patch of several smoothly joined triangular Bezier surfaces, the result is a composite surface of global C^r continuity with a prescribed order r. Some illustrative examples are given.

[1]  Yuan Xu,et al.  Orthogonal Polynomials of Several Variables , 2014, 1701.02709.

[2]  Wang Guo-jin,et al.  A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces , 2008 .

[3]  Pawel Wozny,et al.  Multivariate generalized Bernstein polynomials: identities for orthogonal polynomials of two variables , 2008, Numerical Algorithms.

[4]  Abedallah Rababah,et al.  Distance for degree raising and reduction of triangular Bézier surfaces , 2003 .

[5]  Tom Lyche,et al.  Mathematical methods in computer aided geometric design , 1989 .

[6]  Gerald Farin,et al.  Triangular Bernstein-Bézier patches , 1986, Comput. Aided Geom. Des..

[7]  T. Koornwinder.  Two-Variable Analogues of the Classical Orthogonal Polynomials , 1975 .

[8]  Jet Wimp,et al.  Computation with recurrence relations , 1986 .

[9]  Rene F. Swarttouw,et al.  The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue Report Fac , 1996, math/9602214.

[10]  Qian-qian Hu,et al.  Optimal multi-degree reduction of triangular Bézier surfaces with corners continuity in the norm L2 , 2008 .

[11]  I. Area,et al.  Orthogonal polynomials of two discrete variables on the simplex , 2005 .

[12]  Josef Hoschek,et al.  Fundamentals of computer aided geometric design , 1996 .

[13]  J. McGregor,et al.  Linear Growth Models with Many Types and Multidimensional Hahn Polynomials , 1975 .

[14]  Lizheng Lu.  A note on constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain , 2009 .

[15]  Gian-Carlo Rota,et al.  Theory and application of special functions , 1977 .

[16]  Lian Zhou,et al.  Constrained multi-degree reduction of Bézier surfaces using Jacobi polynomials , 2009, Comput. Aided Geom. Des..

[17]  Guozhao Wang,et al.  Multi-degree reduction of triangular Bézier surfaces with boundary constraints , 2006, Comput. Aided Des..

[18]  Hu Shimin,et al.  Approximate degree reduction of triangular bezier surfaces , 1998 .

[19]  Abedallah Rababah,et al.  L-2 Degree Reduction of Triangular Bézier Surfaces with Common Tangent Planes at Vertices , 2005, Int. J. Comput. Geom. Appl..

[20]  W. N. Bailey.  Contiguous Hypergeometric Functions of the Type 3F2(1) , 1954 .

[21]  Pawel Wozny,et al.  Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials , 2009, Comput. Aided Geom. Des..

[22]  Paul Sablonnière.  Discrete Bézier Curves and Surfaces , 1992 .

[23]  M. V. Tratnik,et al.  Some multivariable orthogonal polynomials of the Askey tableau‐discrete families , 1991 .

[24]  Young Joon Ahn,et al.  Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain , 2008 .

[25]  Paweł Woźny,et al.  Connections between two-variable Bernstein and Jacobi polynomials on the triangle , 2006 .

[26]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .