This computer algorithm was developed in 1981. This program is written in FORTRAN IV for batch execution and has been implemented on an IBM 360 series computer with a central memory requirement of approximately 100K of 8-bit bytes. Once the contour points have been located, the contour may be drawn. To construct the contours, interpolation along the edges of the triangles is performed, using the bivariable polynomial if data smoothing was performed. In general, the data is smoothed using a least-squares-error fit of the data to a bivariate polynomial. The algorithm is based on an interpolation scheme in which the points in the plane are connected by straight line segments to form a set of triangles. The algorithm accepts as input data values at a set of points irregularly distributed over a plane. The algorithm provides for efficient and accurate contouring with a modular approach which allows flexibility in modifying the algorithm for special applications. A general computer algorithm has been developed for the construction of contour plots. The graphical presentation of experimentally or theoretically generated data sets frequently involves the construction of contour plots. A GENERAL ALGORITHM FOR THE CONSTRUCTION OF CONTOUR PLOTS
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |