Advertisement

Numerical Algorithms

, Volume 43, Issue 1, pp 75–98 | Cite as

The mixed directional difference–summation algorithm for generating the Bézier net of a trivariate four-direction Box-spline

Article

Abstract

Trivariate Box-splines lack an efficient and general exact evaluation technique. This paper presents one possible and underexploited approach to solving this problem. The algorithm we propose is based on mixed directional differences and summations for computing the Bézier net coefficients of all trivariate four-direction Box-splines of any degree over tetrahedral tessellations of the domain. A Matlab package, called MDDS, for computing the Bézier net both in the trivariate and bivariate cases, is also provided.

Keywords

trivariate Box-splines recurrence relations exact evaluation tetrahedral Bézier volume decomposition B-net 

Mathematics Subject Classifications (2000)

65D17 68U05 33F99 65D07 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Berchtold, J., Voiculescu, I., Bowyer, A.: Multivariate Bernstein-form polynomials, Technical Report no. 31/98. School of Mechanical Engineering, University of Bath, Bath (1998)Google Scholar
  2. [2]
    Boehm, W.: Calculating with box splines. Comput. Aided Geom. Des. 1(2), 149–162 (1984)MATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    Casciola, G., Franchini, E., Romani, L.: The MDDS package, available at http://www.netlib.org/numeralgo/na23
  4. [4]
    Chui, C.K., Lai, M.J.: Computation of box-splines and B-splines on triangulations of nonuniform rectangular partitions. Approx. Theory its Appl. 3, 37–62 (1987)MATHMathSciNetGoogle Scholar
  5. [5]
    Chui, C.K.: Multivariate Splines. CBMS Lectures Series 54. SIAM, Philadelphia (1988)Google Scholar
  6. [6]
    Chui, C.K., Lai, M.J.: Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes. Comput. Aided Geom. Des. 8, 479–493 (1991)MATHMathSciNetCrossRefGoogle Scholar
  7. [7]
    Cohen, E., Lyche, T., Riesenfeld, R.: Discrete box splines and refinement algorithms. Comput. Aided Geom. Des. 1, 131–141 (1984)MATHCrossRefGoogle Scholar
  8. [8]
    Dæhlen, M.: On the evaluation of box splines. In: Lyche T., Schumaker, L. (eds.) Mathematical Methods in Computer Aided Geometric Design, pp. 167–179. Academic, New York (1989)Google Scholar
  9. [9]
    Dahmen, W., Micchelli, C.A.: Recent progress in multivariate splines. In: Chui, C.K., Schumaker, L.L., Ward, J.D. (eds.) Approximation Theory IV, pp. 27–121. Academic, New York (1983)Google Scholar
  10. [10]
    Dahmen, W.: Bernstein–Bézier representation of polynomial surfaces. In: Extension of B-spline Curve Algorithms to Surfaces. Siggraph ‘86 Lecture Notes. ACM, New York (1986)Google Scholar
  11. [11]
    de Boor, C., De Vore, R.: Approximation by smooth multivariate splines. Trans. Amer. Math. Soc. 276, 775–788 (1983)MATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    de Boor, C., Höllig, K.: Recurrence relations for multivariate B-splines. Proc. Amer. Math. Soc. 85, 397–400 (1982)MATHMathSciNetCrossRefGoogle Scholar
  13. [13]
    de Boor, C., Höllig, K.: B-splines from parallelepipeds. J. Anal. Math. 42, 99–115 (1982)CrossRefGoogle Scholar
  14. [14]
    de Boor, C.: B-form basics. In: Farin, G. (ed.) Geometric Modeling: Applications and New Trends, pp. 131–148. SIAM, Philadelphia (1987)Google Scholar
  15. [15]
    de Boor, C.: On the evaluation of box splines. Numer. Algorithms 5, 5–23 (1993)MATHMathSciNetCrossRefGoogle Scholar
  16. [16]
    de Boor, C., Höllig, K., Riemenschneider, S.: Box Splines. Springer, Berlin Heidelberg New York (1993)MATHGoogle Scholar
  17. [17]
    Höllig, K.: Box splines. In: Chui, C.K., Schumaker, L.L., Ward, J.D. (eds.) Approximation Theory V, pp. 71–95. Academic, New York (1986)Google Scholar
  18. [18]
    Kobbelt, L.: Stable evaluation of box splines. Numer. Algorithms 14(4), 377–382 (1997)MATHMathSciNetCrossRefGoogle Scholar
  19. [19]
    Lasser, D.: Bernstein–Bézier representation of volumes. Comput. Aided Geom. Des. 2(1–3), 145–150 (1985)MATHMathSciNetCrossRefGoogle Scholar
  20. [20]
    Mc Cool, M.D.: Optimized evaluation of Box splines via the inverse FFT. In: Proceedings of Graphics Interface, pp. 34–43. Canadian Information Processing Society, Québec (1995)Google Scholar
  21. [21]
    Goodman, T., Peters, J.: Bézier nets, convexity and subdivision on higher dimensional simplices. Comput. Aided Geom. Des. 12(1), 53–65 (1995)MATHMathSciNetCrossRefGoogle Scholar
  22. [22]
    Lai, M.J.: Fortran subroutines for B-nets of box splines on three- and four-directional meshes. Numer. Algorithms 2, 33–38 (1992)MATHMathSciNetCrossRefGoogle Scholar
  23. [23]
    Peters, J.: Evaluation of multivariate Bernstein polynomials. CMS Technical Report no. 91-1, University of WisconsinGoogle Scholar
  24. [24]
    Peters, J.: Evaluation and approximate evaluation of the multivariate Bernstein–Bézier form on a regularly partitioned simplex. ACM Trans. Math. Softw. 20(4), 460–480 (1994)MATHCrossRefGoogle Scholar
  25. [25]
    Peters, J.: \(C^2\) surfaces built from zero sets of the 7-direction box spline. In: Mullineux, G. (ed.) Proceedings of the sixth IMA Conference on the Mathematics of Surfaces, pp. 463–474. Brunel University Brunel, UK (1994)Google Scholar
  26. [26]
    Prautzsch, H., Boehm, W.: Box Splines. In: Farin, G., Hoschek, J., Kim, M.-S. (eds.) Handbook of Computer Aided Geometric Design, Chapter 10. (2002)Google Scholar
  27. [27]
    Schumaker, L.L., Volk, W.: Efficient evaluation of multivariate polynomials. Comput. Aided Geom. Des. 3(2), 149–154 (1986)MATHCrossRefGoogle Scholar
  28. [28]
    Sun, J., Zhao, K.: On the structure of Bézier nets. J. Comput. Math. 5, 376–383 (1987)MATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of BolognaBolognaItaly
  2. 2.Department of Pure and Applied MathematicsUniversity of PadovaPadovaItaly

Personalised recommendations