Skip to main content
Log in

A discrete monotonous interpolation scheme

Ein diskretes monotones Interpolationsschema

  • Published:
Computing Aims and scope Submit manuscript

Abstract

An algorithm for the problem of transforming a regular array of tabular points into a monotonous array of tabular points is presented.

Zusammenfassung

Es wird ein Algorithmus angegeben, der ein reguläres Feld von Punkten in eine monotones Feld transformiert.

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. Farïn, G.: Curves and surfaces for computer aided geometric design: a practical guide. New York: Academic Press 1988.

    Google Scholar 

  2. Gordon, W. J.: Blending function methods of bivariate and multivariate interpolation and approximation. Siam J. Numer. Anal.8, 154–177 (1971).

    Google Scholar 

  3. Gordon, W. J., Hall, C. A.: Transfinite-element methods: blending-function interpolation over arbitrary curved element domains. Numer. Math.21, 109–129 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partially supported by the Ministero dell' Università e della Ricerca Scientifica e Tecnologica.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morandi, R., Conti, C. A discrete monotonous interpolation scheme. Computing 52, 257–267 (1994). https://doi.org/10.1007/BF02246507

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Key words

Navigation