A triangle-based $C^1$ interpolation method
R.L. Renka,R.L. Renka,A.K. Cline +2 more
TL;DR: In this paper, the authors discuss methods and software for C/sup 1/ interpolation at arbitrarily distributed data points in the plane, using derivative-estimation procedures which lead to interpolatory surfaces constituting very accurate approximations for a variety of test functions.
read more
Abstract: This paper discusses methods and software for C/sup 1/ interpolation at arbitrarily distributed data points in the plane. The primary results presented here are derivative-estimation procedures which lead to interpolatory surfaces constituting very accurate approximations for a variety of test functions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Observation of Resonance Condensation of Fermionic Atom Pairs
TL;DR: In order to search for condensation on either side of the resonance, a technique that pairwise projects fermionic atoms onto molecules is introduced; this enables to measure the momentum distribution of fermionics atom pairs.
2K
Interpolation by regularized spline with tension: I. Theory and implementation
Helena Mitasova,Lubos Mitas +1 more
TL;DR: Bivariate and trivariate functions for interpolation from scattered data are derived in this paper, which are constructed by explicit minimization of a general smoothness functional, and they include a tension parameter that controls the character of the interpolation function (e.g., for bivariate case the surface can be tuned from a “membrane” to a thin steel plate) for modeling of phenomena with a simple type of anisotropy.
442
Multivariate interpolation of large sets of scattered data
TL;DR: A modified Shepard's method for fitting a surface to data values at scattered points in the plane is described that has accuracy comparable to other local methods and computational efficiency is improved by using a cell method for nearest-neighbor searching.
388
Harnessing Filler Materials for Enhancing Biogas Separation Membranes
Chong Yang Chuah,Kunli Goh,Yanqin Yang,Heqing Gong,Wen Li,H. Enis Karahan,Michael D. Guiver,Rong Wang,Tae-Hyun Bae +8 more
TL;DR: This review comprehensively examines filler materials that are capable of enhancing the CO2/CH4 separation performance of polymeric membranes and introduces a new empirical metric, the "Filler Enhancement Index" ( Findex), to aid researchers in assessing the effectiveness of the fillers from a big data perspective.
288
Scattered Data Interpolation and Applications: A Tutorial and Survey
Richard Franke,Gregory M. Nielson +1 more
- 01 Jan 1991
TL;DR: The multivariate scattered data interpolation problem is introduced and the reasons for the difficulty of the problem compared to the one dimensional case are discussed.
207
References
Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1]
TL;DR: A method of blvariate interpolation and smooth surface fitting is developed for z values given at points irregularly distributed in the x-y plane for Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points.
798
Smooth interpolation of large sets of scattered data
Richard Franke,Greg Nielson +1 more
TL;DR: Methods for solving the following data fitting problems are discussed: Given the data (xi,yi,fi), i = 1,...,N construct a smooth bivariate function S with the property that S(xi, Yi) = fi, i = 2, N.
522
A Critical Comparison of Some Methods for Interpolation of Scattered Data
Richard Franke
- 01 Dec 1979
TL;DR: A comparison of 29 methods for solution of the scattered data interpolation problem has been made and a large number of pages of perspective plots of surfaces are given.
321
A method for interpolating scattered data based upon a minimum norm network
TL;DR: A method for interpolating scattered data is described in this paper, which is based upon a triangulation of the domain and a curve network which has certain minimum pseudonorm properties.
A Storage-efficient Method for Construction of a Thiessen Triangulation
TL;DR: In this article, a storage-efficient method and associated algorithms for constructing and representing a triangulation of arbitrarily distributed points in the plane is described, and the algorithm is shown to be efficient in terms of time complexity.