If we keep working with regions in the calculation of FLH, we can store the indices of the valid pixels using A_region (one long vector, linear indexing) and filter the matrices with that vector.
We can also scrap the for-loop of regions and just filter using A_land / A_eez.
Objective: avoid redundancy, and only calculate what is needed at the end.
The size of the matrices will be smaller --> better use of memory and CPU power.
Also, the scripts calculating the FLH will be similar to those calculating particular points at particular locations. The list of points will simply be longer.
If we keep working with regions in the calculation of FLH, we can store the indices of the valid pixels using A_region (one long vector, linear indexing) and filter the matrices with that vector. We can also scrap the for-loop of regions and just filter using A_land / A_eez.
Objective: avoid redundancy, and only calculate what is needed at the end. The size of the matrices will be smaller --> better use of memory and CPU power. Also, the scripts calculating the FLH will be similar to those calculating particular points at particular locations. The list of points will simply be longer.