Added the bulk of the algorithm for GPU accelerated 2D vector curve...

core/cross/gpu2d/cubic_math_utils.h

 /*
  * Copyright 2010, Google Inc.
  * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 78 matching lines @@
 
 // Determines whether the 2D point defined by (px, py) is inside the
 // 2D triangle defined by vertices (ax, ay), (bx, by), and (cx, cy).
 // This test defines that points exactly on an edge are not considered
 // to be inside the triangle.
 bool PointInTriangle(float px, float py,
                      float ax, float ay,
                      float bx, float by,
                      float cx, float cy);
 
+// Determines whether the triangles defined by the points (a1, b1, c1)
+// and (a2, b2, c2) overlap. The definition of this function is that
+// if the two triangles only share an adjacent edge or vertex, they
+// are not considered to overlap.
+bool TrianglesOverlap(float a1x, float a1y,
+                      float b1x, float b1y,
+                      float c1x, float c1y,
+                      float a2x, float a2y,
+                      float b2x, float b2y,
+                      float c2x, float c2y);
+
 }  // namespace cubic
 }  // namespace gpu2d
 }  // namespace o3d
 
 #endif  // O3D_CORE_CROSS_GPU2D_CUBIC_MATH_UTILS_H_