Skip to main content
Log in

Algorithms for smoothing data on the sphere with tensor product splines

Algorithmen für den Ausgleich über die Sphäre durch Tensorprodukt-Splines

  • Contibuted Papers
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Algorithms are presented for fitting data on the sphere by using tensor product splines which satisfy certain boundary constraints. First we consider the least-squares problem when the knots are given. Then we discuss the construction of smoothing splines on the sphere. Here the knots are located automatically. A Fortran IV implementation of these two algorithms is described.

Zusammenfassung

Algorithmen werden vorgestellt für den Ausgleich über die Sphäre mit Hilfe von Tensorprodukt-Splines, die gewissen Randbedingungen genügen müssen. Erst untersuchen wir das Problem der kleinsten Quadrate, wenn die Knoten gegeben sind. Dann besprechen wir die Konstruktion von Ausgleichssplines über die Sphäre. Die Knoten werden hier automatisch lokalisiert. Eine Fortran-IV-Version dieser zwei Algorithmen wird beschrieben.

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. Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. New York: Dover 1968.

    Google Scholar 

  2. de Boor, C.: On calculating withB-splines. J. Approx. Theory6, 50–62 (1972).

    Google Scholar 

  3. Boydstun, L. E., Armstrong, T. J., Bookstein, F. L.: A comparison of three dimensional maximum reach estimation techniques. J. Biomechanics13, 717–724 (1980).

    Google Scholar 

  4. Cox, M. G.: The numerical evaluation ofB-splines. J. Inst. Maths Applics10, 134–149 (1972).

    Google Scholar 

  5. Cox, M. G.: The least-squares solution of overdetermined linear equations having band or augmented band structure. IMA J. Numer. Anal.1, 3–22 (1981).

    Google Scholar 

  6. Dierckx, P.: An algorithm for surface fitting with spline functions. IMA J. Numer. Anal.1, 267–283 (1981).

    Google Scholar 

  7. Dierckx, P.: Algorithms for smoothing data with periodic and parametric splines. Computer Graphics and Image Processing20, 171–184 (1982).

    Google Scholar 

  8. Gentleman, W. M.: Least-squares computations by Givens transformations without square roots. J. Inst. Maths Applics12, 329–336 (1973).

    Google Scholar 

  9. Hayes, J. G., Halliday, J.: The least-squares fitting of cubic spline surfaces to general data sets. J. Inst. Maths Applics14, 89–103 (1974).

    Google Scholar 

  10. Herndon, J. R.: Algorithm 47: Associated Legendre Functions of the first kind for real or imaginary arguments. Comm. ACM4, 178 (1961).

    Google Scholar 

  11. NAG Fortran Library Manual Mark 8, the Numerical Algorithms Group. Oxford: 1980.

  12. Peters, P., Wilkinson, J. H.: The least-squares problem and pseudo-inverses. Comput. J.13, 309–316 (1970).

    Google Scholar 

  13. Reinsch, C.: Smoothing by spline functions. Numer. Math.10, 177–183 (1967).

    Google Scholar 

  14. Suetens, P., Gijbels, J., Oosterlinck, A., Haegemans, A., Dierckx, P.: A three-dimensional image of the cerebral blood vessels and tumor for use in stereotactic neurosurgery. In: Proc. SPIE conference on Three-dimensional imaging, Genève, Vol. 375, 429–435 (1983).

  15. Wahba, G.: Spline interpolation and smoothing on the sphere. SIAM. J. Sci. Stat. Comput.2, 5–16 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dierckx, P. Algorithms for smoothing data on the sphere with tensor product splines. Computing 32, 319–342 (1984). https://doi.org/10.1007/BF02243776

Download citation

  • Received:

  • Issue Date:

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

AMS Subject Classification (1980)

Key words

Navigation