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.
Similar content being viewed by others
References
Cottafava, G., Le Moli, G.: Automatic contour map. Comm. ACM12, 386 (1969).
Rothwell, M. A.: A computer program for the construction of pole figures. J. Appl. Cryst.4, 494 (1971).
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).
Dayhoff, M. O.: A contour-map for X-ray crystallography. Comm. ACM6, 620 (1963).
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).
Bengtsson, B. E., Nordbeck, S.: Construction of isarithms and isarithmic maps by computers. BIT4, 87 (1964).
Lewis, H. R.: Subroutines for computing and graphing level lines of functions of two variables. Los Alamos Scientific Laboratory, Report LA-3877 (1968).
McLain, D. H.: Drawing contours from arbitrary data points. The Computer Journal17, 318 (1974).
Sutcliffe, D. C.: An algorithm for drawing the curvef(x, y)=0. The Computer Journal19, 246 (1976).
Clements, R. C.: PDP-10X-Y Plotter utility routines. Digital equipment corporation, DEC 100-313-005-001968, 1.
Author information
Authors and Affiliations
Additional information
Supported in part by the German Bundesministerium für Forschung und Technologie.
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02252035