2011
DOI: 10.1007/s11004-011-9346-5
|View full text |Cite
|
Sign up to set email alerts
|

Moving Surface Spline Interpolation Based on Green’s Function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(20 citation statements)
references
References 17 publications
0
20
0
Order By: Relevance
“…This minimum curvature method is suitable when the data presents peaks, as occurs in our case. Deng and Tang [17] described the advantages of the method, and they also presented an algorithm to accelerate the method.…”
Section: Resultsmentioning
confidence: 99%
“…This minimum curvature method is suitable when the data presents peaks, as occurs in our case. Deng and Tang [17] described the advantages of the method, and they also presented an algorithm to accelerate the method.…”
Section: Resultsmentioning
confidence: 99%
“…During the generation of GRID structures, the values in interpolation nodes are computed with the use of measurement points located near the mapped node within a given search radius R (Figure 2b). The size of the radius is determined relative to the resolution of the node network, and an interpolation algorithm is selected to control the degree of generalization of the developed surface [42][43][44][45][46]. The shape of the interpolated surface generated based on GRID nodes can differ depending on the applied algorithm and its processing parameters.…”
Section: Selection Of Interpolation Algorithmmentioning
confidence: 99%
“…The shape of the interpolated surface generated based on GRID nodes can differ depending on the applied algorithm and its processing parameters. The choice of interpolation algorithm is determined by many factors, in particular, the distribution of measurement points, the resolution of the generated structure, the number of searched measurement points within a given radius, their location in sectors surrounding the node and the parameters of an interpolation algorithm [45][46][47][48]. In Figure 2, interpolation results are represented by the surfaces generated in the GRID model with inverse distance to a power (IDP), kriging (K) and radial base function (RBF) algorithms.…”
Section: Selection Of Interpolation Algorithmmentioning
confidence: 99%
“…The spatial interpolation function in the MATLAB tool was used, whose algorithm implementation about radial basis function was mainly based on the biharmonic green function [22]. This algorithm is a minimum curvature interpolation, with the interpolation surface constructed by the liner combination of green function with each sampling point as the center by adjusting the weights of each sampling point so that the surface could through all of them.…”
Section: Regional Distribution Characteristicsmentioning
confidence: 99%