In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smoothes the surface. The simulated-annealing search strategy is used to search for the global minimum of the fairing measure.

A C1 piecewise rational trigonometric cubic function with four shape parameters has been constructed to address the problem of visualizing positive data. Simple data-dependent constraints on shape parameters are derived to preserve positivity and assure smoothness. The method is then extended to positive surface data by rational trigonometric bicubic function. The order of approximation of deve...

Image interpolation is the most basic requirement for many image processing tasks such as medical processing. a technique used in resizing an image. To change size, each pixel new must be remapped to location old calculate value. There are algorithms available determining value, of which involve some form between closest pixels In this paper, we use Bicubic algorithm size images from Messidor d...

We evaluate the configuration exponents of various ensembles Hamiltonian paths drawn on random planar bicubic maps. These are estimated from extrapolations exact enumeration results for finite sizes and compared with their theoretical predictions based Knizhnik, Polyakov Zamolodchikov (KPZ) relations, as applied to regular counterpart honeycomb lattice. show that a naive use these relations doe...

A complete stability and convergence analysis is given for twoand three-level, piecewise Hermite bicubic orthogonal spline collocation, Laplacemodified and alternating-direction schemes for the approximate solution of linear parabolic problems on rectangles. It is shown that the schemes are unconditionally stable and of optimal-order accuracy in space and time.

The RKHS-based optimal image interpolation method, presented by Chen and de Figueiredo (1993), is applied to scattered potential field measurements. The RKHS which admits only interpolants consistent with Laplace's equation is defined and its kernel, derived. The algorithm is compared to bicubic spline interpolation, and is found to yield vastly superior results.

We discuss linear methods for interpolation, including nearest neighbor, bilinear, bicubic, splines, and sinc interpolation. We focus on separable interpolation, so most of what is said applies to one-dimensional interpolation as well as N-dimensional separable interpolation. Source Code The source code (ANSI C), its documentation, and the online demo are accessible at the IPOL web page of this...