Skip to main content
SpringerLink
Log in

Fortran subroutines for B-nets of box splines on three- and four-directional meshes

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We describe an algorithm to compute the B-nets of bivariate box splines on a three-or four-directional mesh. Two pseudo Fortran programs for those B-nets are given.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Boehm, Generating the Bézier points of triangular splines, in:Computer Aided Geometric Design, eds. R.E. Barnhill and W. Boehm. North-Holland, Amsterdam, 1983 pp. 77–91.

    Google Scholar 

  2. C. de Boor B-form basics, in:Geometric Modeling, ed. G. Farin (SIAM Publ., Philadelphia, 1987), pp. 131–148.

    Google Scholar 

  3. C. de Boor and K. Höllig, B-splines from parallelepipeds, J. Analyse Math. 42 (1982/83) 99–115.

    Google Scholar 

  4. C. de Boor, K. Höllig and S. Riemenschneider, Bivariate cardinal interpolation by splines on a three-direction mesh, Illinois J. Math. 29 (1985) 533–566.

    Google Scholar 

  5. C.K. Chui,Multivariate Splines, CMBS No. 54 on Applied Math. (SIAM Publ., Philadelphia, 1988).

    Google Scholar 

  6. C.K. Chui, H. Diamond and L.A. Raphael, Interpolation by multivariate splines, Math. Comp. 51 (1988) 203–218.

    Google Scholar 

  7. C.K. Chui and M.J. Lai, Computation of box splines and B-splines on triangulations of nonuniform rectangular partitions, Approx. Theory appl. 3 (1987) 37–62.

    Google Scholar 

  8. E. Cohen, T. Lyche and R. Riesenfeld, Discrete box splines and refinement algorithms, Comput. Aided Geom. Design 1 (1984) 131–141.

    Article  Google Scholar 

  9. W. Dahmen and C.A. Micchelli, Subdivision algorithms for the generation of box-spline surfaces, Comput. Aided Geom. Design 1 (1984) 115–129.

    Article  Google Scholar 

  10. W. Dahmen and C.A. Micchelli, Line average algorithm: a method for the computer generation of smooth surfaces, Comput. Aided Geom. Design 2 (1985) 77–85.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Utah, 84112, Salt Lake City, UT, U.S.A.

    Ming-Jun Lai

Authors
  1. Ming-Jun Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. Brezinski and M. Redivo Zaglia

Research supported by a Faculty Grant From the University of Utah Research Committee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, MJ. Fortran subroutines for B-nets of box splines on three- and four-directional meshes. Numer Algor 2, 33–38 (1992). https://doi.org/10.1007/BF02142204

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02142204

Subject classification

Keywords and phrases

Search

Navigation