commit 45a8fc6a8b00451f807783f2a6ec640e9bcc7256
author caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Feb 14 15:29:11 2013 +0000
committer caryclark@google.com <caryclark@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> Thu Feb 14 15:29:11 2013 +0000
tree bf483ee177b764a83768534293b9542a5a0c036e
parent 3976825a21532e254311b90b4a9046e25717e335

shape ops work in progress

git-svn-id: http://skia.googlecode.com/svn/trunk@7738 2bbb7eff-a529-9590-31e7-b0007b416f81

experimental/Intersection/CubicReduceOrder.cpp

diff --git a/experimental/Intersection/CubicReduceOrder.cpp b/experimental/Intersection/CubicReduceOrder.cpp
index 29920ab..bd1356a 100644
--- a/experimental/Intersection/CubicReduceOrder.cpp
+++ b/experimental/Intersection/CubicReduceOrder.cpp
@@ -205,10 +205,20 @@
         }
     }
     for (index = 0; index < 4; ++index) {
-        if (AlmostEqualUlps(cubic[index].x, cubic[minX].x)) {
+        double cx = cubic[index].x;
+        double cy = cubic[index].y;
+        double denom = SkTMax(fabs(cx), SkTMax(fabs(cy),
+                SkTMax(fabs(cubic[minX].x), fabs(cubic[minY].y))));
+        if (denom == 0) {
+            minXSet |= 1 << index;
+            minYSet |= 1 << index;
+            continue;
+        }
+        double inv = 1 / denom;
+        if (approximately_equal_half(cx * inv, cubic[minX].x * inv)) {
             minXSet |= 1 << index;
         }
-        if (AlmostEqualUlps(cubic[index].y, cubic[minY].y)) {
+        if (approximately_equal_half(cy * inv, cubic[minY].y * inv)) {
             minYSet |= 1 << index;
         }
     }