Details
Description
The BEAM pixel geo-coding (quad-tree-search branch) makes a quick (and dirty) test before searching the pixel position for a given geo-position in a given pixel rectangle. The test is too dirty (line 554):
final boolean definitelyOutside = lat < latMin || lat > latMax || lon < lonMin || lon > lonMax;
usually yields 'true' for full-orbit products, even though the geo-position of interest is covered by the product. This bug affects TMI and AMSR-E products, which are used in the SST CCI project. A workaround for this issue has been realized in the SST CCI project (call SimplePixelGeoCoding) that performs a more careful test. The test however is also much slower...
final boolean definitelyOutside = lat < latMin || lat > latMax || lon < lonMin || lon > lonMax;
usually yields 'true' for full-orbit products, even though the geo-position of interest is covered by the product. This bug affects TMI and AMSR-E products, which are used in the SST CCI project. A workaround for this issue has been realized in the SST CCI project (call SimplePixelGeoCoding) that performs a more careful test. The test however is also much slower...