You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The C version does this and it is (imho) not unexpected because Shewchuk's algorithms only handle round-off errors, not overflow/underflow in intermediate results. The test for the correctness of the approximate result (
) can succeed even if it is incorrect due to underflow and none of the exact computations (two_{sum, product}, expansion_sum, etc.) will handle overflow or underflow well.
Covering such inputs would require non-trivial changes in the implementation. For the tests of the approximate results there would be changes needed to cover underflow (such as in https://doi.org/10.1007/s10543-015-0574-9 or https://doi.org/10.1007/s10543-023-00975-x) but more problematically, for the exact computations an alternative would be required with extended exponent range.
Is this expected? Does the C version do this?
Found via #18
The text was updated successfully, but these errors were encountered: