Algorithm 833

Robert J. Renka · ACM Transactions on Mathematical Software · 2004

We describe a Fortran-77 software package for constructing a C 1 convex surface that interpolates a convex data set consisting of data values at arbitrarily distributed points in the plane (nodes) such that there exists a triangulation of the nodes for which the triangle-based piecewise linear interpolant is convex. The method consists of constructing this data-dependent triangulation, computing a set of nodal gradients for which there exists a convex piecewise linear Hermite interpolant H of the nodal values and gradients, and applying convolution smoothing to H .

Read the paper · More papers on PaperTik