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
If the input coordinates are NaN, the call to tessTesselate segfaults in pqInit, since the code falsely assumes a total ordering. Possibly tessAddCountour should check that the values are not NaN?
The function LEQ eventually expands to does comparisons with <= and <, which are always false for NaN. Thus LT(x, y) is always true, and the code here:
do {
do { ++i; } while( GT( **i, *piv ));
do { --j; } while( LT( **j, *piv ));
Swap( i, j );
} while( i < j );
increments i until that pointer escapes the array bounds.
The text was updated successfully, but these errors were encountered:
If the input coordinates are NaN, the call to
tessTesselate
segfaults inpqInit
, since the code falsely assumes a total ordering. PossiblytessAddCountour
should check that the values are not NaN?Specifically, it defines its comparisons as:
The function
LEQ
eventually expands to does comparisons with<=
and<
, which are always false for NaN. ThusLT(x, y)
is always true, and the code here:increments
i
until that pointer escapes the array bounds.The text was updated successfully, but these errors were encountered: