Let's a consider a situation where the input grid for an interpolation is too large to fit in memory.
A natural way to distribute the interpolation would be to:
load chunks of the grid on a distributed cluster (dask of course)
perform interpolations for each of the chunks and retain information about distances between target points and input grid.
collect results and choose which ones corresponds to the best anwser.
My interrogation is with 2.: it is possible to retain distance information between target points and input grid points that are used for the interpolation?
The only structure you can use to do this is the RTRee class. The query method will return the values of the selected data and the associated distances in meters.
Let's a consider a situation where the input grid for an interpolation is too large to fit in memory. A natural way to distribute the interpolation would be to:
My interrogation is with 2.: it is possible to retain distance information between target points and input grid points that are used for the interpolation?