1989
DOI: 10.1137/0726013
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for Monotone Piecewise Bicubic Interpolation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 58 publications
(28 citation statements)
references
References 3 publications
0
28
0
Order By: Relevance
“…Concerning monotonicity preserving surface fitting most research focussed on monotone bivariate interpolation. In [1,2,12] sufficient (and sometimes also necessary) conditions were derived for the monotonicity of piecewise polynomial patches interpolating data given at the grid points of a rectangular mesh. These conditions were transformed into a system of linear inequalities which in turn formed the basis for an algorithm.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Concerning monotonicity preserving surface fitting most research focussed on monotone bivariate interpolation. In [1,2,12] sufficient (and sometimes also necessary) conditions were derived for the monotonicity of piecewise polynomial patches interpolating data given at the grid points of a rectangular mesh. These conditions were transformed into a system of linear inequalities which in turn formed the basis for an algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…The method we present in this paper is inspired by the algorithms given in [1,2,12], where C 1 monotone increasing spline functions interpolating gridded data are constructed by iteratively adjusting initially estimated gradient values at each grid point. It is a kind of Hermite interpolation, where the gradient values are adjusted to ensure monotonicity.…”
Section: Monotonic Polynomial Interpolationmentioning
confidence: 99%
See 1 more Smart Citation
“…There are several ways to implement interpolation and in this study a shape-preserving piecewise cubic polynomial was chosen [18,19]. This function is directly available in MATLAB and in contrast to for example spline functions, it seeks to preserve local minima and other features of the data such that extreme artifacts are not introduced by the interpolation (see Figure 2).…”
Section: Theorymentioning
confidence: 99%
“…This allows arbitrary order in the finite difference methods for computing the derivatives and then, by storing the resulting state variables, a simple bilinear interpolation can be used at runtime without concern for derivatives being continuous across grid points. Higher-order interpolation schemes such as BIMOND [42,43] can be introduced at the precompute stage to up-sample the table density, increasing accuracy without significant impact on runtime.…”
Section: Table Interpolationmentioning
confidence: 99%