Bicubic interpolation

About: Bicubic interpolation is a research topic. Over the lifetime, 3348 publications have been published within this topic receiving 73126 citations.

Application of Hardy's multiquadric interpolation to hydrodynamics

Abstract: Hardy's multiquadric interpolation (MQI) scheme is a global, continuously differentiable interpolation method for solving scattered data interpolation problems. It is capable of producing monotonic, extremely accurate interpolating functions, integrals, and derivatives. Derivative estimates for a variety of one and two-dimensional surfaces were obtained. MQI was then applied to the spherical blast wave problem of von Neumann. The numerical solution agreed extremely well with the exact solution. 17 refs., 3 figs., 2 tabs.

Localization and comparison of two free-form surfaces

Abstract: Comparison of two free-form surfaces based on discrete data points is of paramount importance for reverse engineering. It can be used to assess the accuracy of the reconstructed surfaces and to quantify the difference between two such surfaces. The entire process involves three main steps: data acquisition, 3D feature localization and quantitative comparison. This paper presents models and algorithms for 3D feature localization and quantitative comparison. Complex free-form surfaces are represented by bicubic parametric spline surfaces using discrete points. A simple yet effective pseudoinverse algorithm was developed and implemented for localization. It consists of two iterative operations, namely, constructing a pseudo transformation matrix and point matching. A computing algorithm was developed to compare two such surfaces using optimization techniques. Since this approach does not involve solving non-linear equations for the parameters of positions and orientations, it is fast and robust. The algorithm was implemented and tested with several examples. It is effective and can be used in industry for sculptured surface comparison.

Weighted bicubic spline interpolation to rapidly varying data

Abstract: The weighted bicubic spline that is a C1 piecewise bicubic interpolant to three-dimensional gridded data is introduced. This is a generalization of the univariate weighted spline, developed by Salkauskas, in that a weighted minimization problem is solved. The minimization problem solved is a weighted version of the problem that the natural bicubic spline and Gordon's spline-blended interpolants minimize. The surface is represented as a piecewise bicubic Hermite interpolant whose derivatives are the solution of a linear system of equations. For computer-aided-design applications, the shape of the surface is controlled by weighting the variation over the individual patches, whereas many other shape-control methods weight the discrete data points. A method for selecting the weights is presented so that the weighted bicubic spline effectively solves the important and often difficult problem of interpolating rapidly varying data.