Skip to main content
Log in

A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular Bézier surfaces. This algorithm possesses four characteristics: ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L 2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bohem W, Farin G, Kahman J. A survey of curve and surface methods in CAGD. Comput Aid Geometr Design, 1984, 1(1): 1–60

    Article  Google Scholar 

  2. Danneberg L, Nowacki H. Approximate conversion of surface representations with polynomial bases. Comput Aid Geometr Design, 1985, 2(1–3): 123–132

    Article  Google Scholar 

  3. Forrest A. Interactive interpolation and approximation by Bézier polynomials. Comput J, 1972, 15(1): 71–79

    MathSciNet  Google Scholar 

  4. Farin G. Algorithms for rational Bézier curves. Comput-Aid Design, 1983, 15(2): 73–77

    Article  Google Scholar 

  5. Watkins M, Worsey A. Degree reduction for Bézier curves. Comput-Aid Design, 1988, 20(7): 398–405

    Article  MATH  Google Scholar 

  6. Eck M. Degree reduction of Bézier curves. Comput Aid Geometr Design, 1993, 10(3): 237–252

    Article  MATH  MathSciNet  Google Scholar 

  7. Chen G D, Wang G J. Optimal multi-degree reduction of Bézier curves with constraints of endpoints continuity. Comput Aid Geometr Design, 2002, 19(6): 365–377

    Article  Google Scholar 

  8. Zheng J M, Wang G Z. Perturbing Bézier coefficients for best constrained degree reduction in the L 2 norm. Graphical Models, 2003, 65(6): 351–368

    Article  MATH  Google Scholar 

  9. Ahn Y J, Lee B G, Park Y, et al. Constrained polynomial degree reduction in the L 2 norm equals best weighted Euclidean approximation of coefficients. Comput Aid Geometr Design, 2004, 21(2): 181–191

    Article  MATH  MathSciNet  Google Scholar 

  10. Zhang R J, Wang G J. Constrained Bézier curves’ best multi-degree reduction in the L 2 norm. Prog Nat Sci, 2005, 15(9): 843–850

    Article  MATH  Google Scholar 

  11. Guo Q W, Zhu G Q. New approach to approximate multi-degree reduction of tensor product Bézier surfaces. J Comput-Aid Design & Comput Graph (in Chinese), 2004, 16(6): 777–782

    Google Scholar 

  12. Chen G D, Wang G J. Multi-degree reduction of tensor product Bézier surfaces with conditions of corners interpolations. Sci China Ser F-Inf Sci, 2002, 45(1): 51–58

    MATH  Google Scholar 

  13. Hu S M, Zheng G Q, Sun J G. Approximate degree reduction of rectangular Bézier surfaces. J Software, 1997, 4(4): 353–361

    Google Scholar 

  14. Rababah A. Distance for degree raising and reduction of triangular Bézier surfaces. J Comput Appl Math, 2003, 158(2): 233–241

    Article  MATH  MathSciNet  Google Scholar 

  15. Hu S M, Zuo Z, Sun J G. Approximate degree reduction of triangular Bézier surface. Tsinghua Sci Tech, 1998, 3(2): 1001–1004

    MATH  Google Scholar 

  16. Lewanowicz S, Woźny P. Connections between two-variable Bernstein and Jacobi polynomials on the triangle. J Comput Appl Math, 2006, 197(2): 520–523

    Article  MATH  MathSciNet  Google Scholar 

  17. Farin G. Curves and Surfaces for CAGD, A Practical Guide. 5th ed. San Francisco: Morgan Kaufmann, 2001. 1–499

    Google Scholar 

  18. Dunll C, Xu Y. Orthogonal Polynomials of Several Variables. Cambridge: Cambridge University Press, 2001. 1–391

    Google Scholar 

  19. Koekoek R., Swarttouw R F. The Askey scheme by hypergeometric orthogonal polynomials and its q-analogue. Fac Techn Math Informatics, Delft University of Technology, Report 98-17, Delft, 1998

  20. Andrews G E., Askey R, Roy R. Special Functions. Cambridge: Cambridge University Press, 1999

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wang GuoJin.

Additional information

Supported by the National Grand Fundamental Research 973 Program of China (Grant No. 2004CB719400), the National Natural Science Foundation of China (Grant Nos. 60673031 and 60333010) and the National Natural Science Foundation for Innovative Research Groups (Grant No. 60021201)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hu, Q., Wang, G. A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces. Sci. China Ser. F-Inf. Sci. 51, 13–24 (2008). https://doi.org/10.1007/s11432-007-0063-0

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-007-0063-0

Keywords

Navigation