Piecewise Polynomial Monotonic Interpolation of 2D Gridded Data
A method for interpolating monotone increasing 2D scalar data with a monotone piecewise cubic C1-continuous surface is presented. Monotonicity is a sufficient condition for a function to be free of critical points inside its domain. The standard axial monotonicity for tensor-product surfaces is however too restrictive. We therefore introduce a more relaxed monotonicity constraint. We derive sufficient conditions on the partial derivatives of the interpolating function to ensure its monotonicity. We then develop two algorithms to effectively construct a monotone C1 surface composed of cubic triangular Bézier surfaces interpolating a monotone gridded data set. Our method enables to interpolate given topological data such as minima, maxima and saddle points at the corners of a rectangular domain without adding spurious extrema inside the function domain. Numerical examples are given to illustrate the performance of the algorithm.
KeywordsLocal Extremum Monotonicity Constraint Regular Vertex Grid Vertex Hermite Data
- 4.Cavaretta Jr., A.S., Sharma, A.: Variation diminishing properties and convexity for the tensor product bernstein operator. In: Yadav, B.S., Singh, D. (eds.) Functional Analysis and Operator Theory. Lecture Notes in Mathematics, vol. 1511, pp. 18–32. Springer, Berlin/Heidelberg (1992)CrossRefGoogle Scholar
- 8.Farin, G.E.: Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code, 4th edn. Academic, Orlando (1996)Google Scholar