gdalwarp: -crop_to_cutline floats comparison
When using gdalwarp utility with -cutline -crop_to_cutline and reprojection it sometimes happens that for similarly sized data process takes enormously greater amount of time. Issue is caused by direct comparison of floats in gdalwarp_lib.cpp CropToCutline function (diff in atachment). For some unfortunate values condition will never be met resulting in full ten iterations of algorithm. Proposed solution is based on: http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon
Change History
(6)
Summary: |
gdalwarp: -crop_tu_cutline floats comparison → gdalwarp: -crop_to_cutline floats comparison
|
Resolution: |
→ fixed
|
Status: |
new → closed
|
In 40600: