pyinterp.RTree.inverse_distance_weighting#
- RTree.inverse_distance_weighting(coordinates: ndarray, radius: Optional[float] = None, k: Optional[int] = 9, p: Optional[int] = 2, within: Optional[bool] = True, num_threads: Optional[int] = 0) Tuple[ndarray, ndarray] [source]#
Interpolation of the value at the requested position by inverse distance weighting method.
- Parameters:
coordinates – a matrix
(n, ndims)
wheren
is the number of observations andndims
is the number of coordinates in order: longitude and latitude in degrees, altitude in meters and then the other coordinates defined in Euclidean space ifdims
> 3. If the shape of the matrix is(n, ndims)
then the method considers the altitude constant and equal to zero.radius – The maximum radius of the search (m). Defaults The maximum distance between two points.
k – The number of nearest neighbors to be used for calculating the interpolated value. Defaults to
9
.p – The power parameters. Defaults to
2
.within – If true, the method ensures that the neighbors found are located around the point of interest. In other words, this parameter ensures that the calculated values will not be extrapolated. Defaults to
true
.num_threads – The number of threads to use for the computation. If 0 all CPUs are used. If 1 is given, no parallel computing code is used at all, which is useful for debugging. Defaults to
0
.
- Returns:
The interpolated value and the number of neighbors used in the calculation.