An Efficient Trivariate Algorithm for Tetrahedral Shepard Interpolation
نویسندگان
چکیده
منابع مشابه
Algorithm XXX: SHEPPACK: Modified Shepard Algorithm for Interpolation of Scattered Multivariate Data
Scattered data interpolation problems arise in many applications. Shepard’s method for constructing a global interpolant by blending local interpolants using local-support weight functions usually creates reasonable approximations. SHEPPACK is a Fortran 95 package containing five versions of the modified Shepard algorithm: quadratic (Fortran 95 translations of Algorithms 660, 661, and 798), cub...
متن کاملA trivariate clough-tocher scheme for tetrahedral data
An interpolation scheme is described for values of position, gradient and Hessian at scattered points in three variables. The domain is assumed to have been tesselated into tetrahedra. The interpolant has local support, is globally once differentiable, piecewise polynomial, and reproduces polynomials of degree up to three exactly. The scheme has been implemented in a FORTRAN research code. AMS ...
متن کاملConstrained Visualization Using the Shepard Interpolation Family
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive. We show how the Modified Quadratic Shepard method, which interpolates scattered data of any dimensionality, can be constrained to preserve positivity. We do this by forcing the quadratic basis functions to be positive...
متن کاملAn Efficient Natural Neighbour Interpolation Algorithm for Geoscientific Modelling
Although the properties of natural neighbour interpolation and its usefulness with scattered and irregularly spaced data are well-known, its implementation is still a problem in practice, especially in three and higher dimensions. We present in this paper an algorithm to implement the method in two and three dimensions, but it can be generalized to higher dimensions. Our algorithm, which uses t...
متن کاملEfficient algorithm for discrete sinc interpolation.
A new computing method for discrete-signal sinc interpolation suitable for use in image and signal processing and the synthesis of holograms is described. It is shown to be superior to the commonly used zero-padding interpolation method in terms of interpolation accuracy, flexibility, and computational complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2020
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-020-01159-3