Numerical Algorithms

, Volume 75, Issue 1, pp 93–111 | Cite as

Constrained approximation of rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

  • Stanisław Lewanowicz
  • Paweł Keller
  • Paweł Woźny
Original Paper

Abstract

We propose a novel approach to the problem of polynomial approximation of rational Bézier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual Bernstein polynomials and applying a smart algorithm for evaluating a collection of two-dimensional integrals. Some illustrative examples are given.

Keywords

Rational triangular Bézier surface Polynomial approximation Bivariate dual Bernstein basis Two-dimensional integral Adaptive quadrature 

Mathematics Subject Classification (2010)

41A10 65D17 65D30 33D45 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahlfors, L.V.: Complex Analysis, 3rd edn. McGraw-Hill (1979)Google Scholar
  2. 2.
    Andrews, G.E., Askey, R., Roy, R.: Special Functions, Encyclopedia of Mathematics and its Applications, vol. 71. Cambridge University Press, Cambridge (1999)Google Scholar
  3. 3.
    Chen, J., Wang, G.J.: Progressive-iterative approximation for triangular Bézier surfaces. Comp. Aided-Des. 43, 889–895 (2011)CrossRefGoogle Scholar
  4. 4.
    Dahlquist, G., Björck, A.: Numerical Methods in Scientific Computing, vol. I. Society for Industrial and Applied Mathematics, Philadelphia (2008)CrossRefMATHGoogle Scholar
  5. 5.
    Farin, G.: Triangular Bernstein-Bézier patches. Comput. Aided Geom. Des. 3, 83–127 (1986)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Farin, G.: Curves and Surfaces for Computer-Aided Geometric Design. A Practical Guide, 5t. Academic Press, Boston (2002)Google Scholar
  7. 7.
    Gentleman, W.M.: Implementing Clenshaw-Curtis quadrature – II. Computing the cosine transformation. Commun. ACM 15, 343–346 (1972)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Hu, Q.Q.: An iterative algorithm for polynomial approximation of rational triangular Bézier surfaces. Appl. Math. Comput. 219, 9308–9316 (2013)MathSciNetMATHGoogle Scholar
  9. 9.
    Keller, P.: A method for indefinite integration of oscillatory and singular functions. Numer. Algor. 46, 219–251 (2007)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Koekoek, R., Swarttouw, R.F.: The Askey scheme of hypergeometric orthogonal polynomials and its q-analogue. Fac. Techn. Math. Informatics, Delft Univ. of Technology, Rep. 98-17, Delft (1998)Google Scholar
  11. 11.
    Lewanowicz, S., Keller, P., Woźny, P.: Bézier form of dual bivariate Bernstein polynomials. arxiv:1510.08246[math.NA] (2015)
  12. 12.
    Lewanowicz, S., Woźny, P.: Connections between two-variable Bernstein and Jacobi polynomials on the triangle. J. Comput. Appl. Math. 197, 520–533 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lewanowicz, S., Woźny, P., Keller, P.: Weighted polynomial approximation of rational Bézier curves. arXiv:1502.07877[math.NA] (2015)
  14. 14.
    Lewanowicz, S., Woźny, P., Keller, P.: Polynomial approximation of rational Bézier curves with constraints. Numer. Algor. 59, 607–622 (2012)CrossRefMATHGoogle Scholar
  15. 15.
    Rivlin, T.J.: Chebyshev Polynomials. From Approximation Theory to Algebra and Number Theory, 2nd edn. Wiley, New York (1990)MATHGoogle Scholar
  16. 16.
    Sharma, R.: Conversion of a rational polynomial in triangular Bernstein-Bézier form to polynomial in triangular Bernstein-Bézier form. Internat. J. Comput. Appl. Math. 8, 45–52 (2013)Google Scholar
  17. 17.
    Woźny, P., Lewanowicz, S.: Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials. J. Comput. Appl. Math. 235, 785–804 (2010)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Xu, H.X., Wang, G.J.: Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces. J. Comput. Appl. Math. 228, 287–295 (2009)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Xu, H.X., Wang, G.J.: New algorithm of polynomial triangular B-B surfaces approximation to rational triangular B-B surfaces. J. Inform. Comput. Sci. 7, 725–738 (2010)Google Scholar
  20. 20.
    Zhang, L., Wang, G.J.: An effective algorithm to approximate rational triangular B-B surfaces using polynomial forms (in Chinese). Chin. J. Comput. 29, 2151–2162 (2006)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Stanisław Lewanowicz
    • 1
  • Paweł Keller
    • 2
  • Paweł Woźny
    • 1
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  2. 2.Faculty of Mathematics and Information ScienceWarsaw University of TechnologyWarszawaPoland

Personalised recommendations