commit | 80a83adaf2f8db849bfae288e31b7c789dafabf5 | [log] [tgz] |
---|---|---|
author | caryclark <caryclark@google.com> | Tue Aug 12 05:49:37 2014 -0700 |
committer | Commit bot <commit-bot@chromium.org> | Tue Aug 12 05:49:37 2014 -0700 |
tree | bcd309242d9c40a924e081367b5cac669f881d4b | |
parent | c019ec412ba2704bc6e2cdfd321ea06787ba415d [diff] |
relax quadratic binary search test Extreme implicit quartic equations solve to roots that are different enough that they appear to have failed. In this case, fall back on binary searching to find an intersection. Relax the condition when this happens; don't give up just because the computed implicit root points aren't remotely the same. TBR=reed BUG=skia:2808 Author: caryclark@google.com Review URL: https://codereview.chromium.org/456383003