Skip to main content
Log in

Algorithm 35 an algorithm for non-smoothing contour representations of two-dimensional arrays

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The FORTRAN code calculates, plots and labels approximate contour linesz(x, y)=c for data that are given as a rectangular arrayz ik =z(x i ,y k ).

Zusammenfassung

Das FORTRAN-Programm berechnet, zeichnet und beschriftet angenäherte Niveau-Linienz(x, y)=c zu Daten, die als rechteckiges Feldz ik =z(x i ,y k ) vorgegeben sind.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cottafava, G., Le Moli, G.: Automatic contour map. Comm. ACM12, 386 (1969).

    Google Scholar 

  2. Rothwell, M. A.: A computer program for the construction of pole figures. J. Appl. Cryst.4, 494 (1971).

    Google Scholar 

  3. Robinson, E. L., Scarton, H. A.: CONTOR: A FORTRAN subroutine to plot smooth contours of a single-valued arbitrary three-dimensional surface. J. Comput. Phys.10, 242 (1972).

    Google Scholar 

  4. Dayhoff, M. O.: A contour-map for X-ray crystallography. Comm. ACM6, 620 (1963).

    Google Scholar 

  5. Crane, C. M.: Contour plotting for functions specified at nodal points of an irregular mesh based on an arbitrary two parameter coordinate system. The Computer Journal15, 382 (1972).

    Google Scholar 

  6. Bengtsson, B. E., Nordbeck, S.: Construction of isarithms and isarithmic maps by computers. BIT4, 87 (1964).

    Google Scholar 

  7. Lewis, H. R.: Subroutines for computing and graphing level lines of functions of two variables. Los Alamos Scientific Laboratory, Report LA-3877 (1968).

  8. McLain, D. H.: Drawing contours from arbitrary data points. The Computer Journal17, 318 (1974).

    Google Scholar 

  9. Sutcliffe, D. C.: An algorithm for drawing the curvef(x, y)=0. The Computer Journal19, 246 (1976).

    Google Scholar 

  10. Clements, R. C.: PDP-10X-Y Plotter utility routines. Digital equipment corporation, DEC 100-313-005-001968, 1.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by the German Bundesministerium für Forschung und Technologie.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schultheis, H., Schultheis, R. Algorithm 35 an algorithm for non-smoothing contour representations of two-dimensional arrays. Computing 19, 381–387 (1978). https://doi.org/10.1007/BF02252035

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation