Algorithm 626: TRICP: a contour plot program triangular meshes
ACM Transactions on Mathematical Software (TOMS)
Introduction to the Graphical Kernel System (GKS) (2nd ed. revised for international standard)
Introduction to the Graphical Kernel System (GKS) (2nd ed. revised for international standard)
Scattered data interpolation and approximation with error bounds
Computer Aided Geometric Design
Computing area filling contours for surfaces defined by piecewise polynomials
Computer Aided Geometric Design
A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
Journal of the ACM (JACM)
Algorithm 531: Contour Plotting [J6]
ACM Transactions on Mathematical Software (TOMS)
An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
ACM Transactions on Mathematical Software (TOMS)
A method of bivariate interpolation and smooth surface fitting based on local procedures
Communications of the ACM
Topologically reliable display of algebraic curves
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Algorithm 684: C1- and C2-interplation on triangles with quintic and nonic bivariate polynomials
ACM Transactions on Mathematical Software (TOMS)
GRASPARC: a problem solving environment integrating computation and visualization
VIS '93 Proceedings of the 4th conference on Visualization '93
| Hi-index | 0.01 |
An algorithm plotting contour lines for discrete values zij, given at the nodes of a rectangular mesh is described. A bicubic Hermite polynomial f(x, y) is determined for every rectangle of the mesh, interpolating the zij and the derivatives zx, zy, and zxy. The derivatives are optionally computed by the algorithm. The contours found are normally smooth curves. They consist of polygons approximating intersections with the bicubics. It is possible to fill the areas between them with certain colors or patterns. This is done with a piecewise technique rectangle by rectangle. The method for finding the points of the polygons is shortly reviewed, and some numerical problems are pointed out. The algorithm has a flexible, easy-to-use interface and is easily installed with all plotting systems, provided that a fill-area command is available. A GKS interface may be used.