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.
Similar content being viewed by others
References
Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. New York: Dover 1968.
de Boor, C.: On calculating withB-splines. J. Approx. Theory6, 50–62 (1972).
Boydstun, L. E., Armstrong, T. J., Bookstein, F. L.: A comparison of three dimensional maximum reach estimation techniques. J. Biomechanics13, 717–724 (1980).
Cox, M. G.: The numerical evaluation ofB-splines. J. Inst. Maths Applics10, 134–149 (1972).
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).
Dierckx, P.: An algorithm for surface fitting with spline functions. IMA J. Numer. Anal.1, 267–283 (1981).
Dierckx, P.: Algorithms for smoothing data with periodic and parametric splines. Computer Graphics and Image Processing20, 171–184 (1982).
Gentleman, W. M.: Least-squares computations by Givens transformations without square roots. J. Inst. Maths Applics12, 329–336 (1973).
Hayes, J. G., Halliday, J.: The least-squares fitting of cubic spline surfaces to general data sets. J. Inst. Maths Applics14, 89–103 (1974).
Herndon, J. R.: Algorithm 47: Associated Legendre Functions of the first kind for real or imaginary arguments. Comm. ACM4, 178 (1961).
NAG Fortran Library Manual Mark 8, the Numerical Algorithms Group. Oxford: 1980.
Peters, P., Wilkinson, J. H.: The least-squares problem and pseudo-inverses. Comput. J.13, 309–316 (1970).
Reinsch, C.: Smoothing by spline functions. Numer. Math.10, 177–183 (1967).
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).
Wahba, G.: Spline interpolation and smoothing on the sphere. SIAM. J. Sci. Stat. Comput.2, 5–16 (1981).
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02243776