         let c1b = c1.curve.boundingBox
         let c2b = c2.curve.boundingBox
         if ((c1b.size.x + c1b.size.y) < threshold && (c2b.size.x + c2b.size.y) < threshold) {
-           // return [ Intersection(t1: (c1._t1+c1._t2) / 2.0, t2: (c2._t1+c2._t2) / 2.0) ]
-        
+            // return [ Intersection(t1: (c1._t1+c1._t2) / 2.0, t2: (c2._t1+c2._t2) / 2.0) ]
+            
             let a1 = c1.curve.points[0]
             let b1 = c1.curve.points.last! - c1.curve.points[0]
             let a2 = c2.curve.points[0]
             let b2 = c2.curve.points.last! - c2.curve.points[0]
-
+            
             let _a = b1.x
             let _b = -b2.x
             let _c = b1.y

            }
            return []
        }
        
        // linear roots are even easier
        if p.count == 2 {
            let a = p[0]

            forward: forward,
            back: back
        )
        // TODO: intersections method
        //        var self = utils
        //        shape.intersections = function(s2) {
        //        return self.shapeintersections(shape,shape.bbox,s2,s2.bbox, curveIntersectionThreshold)
        //        }
        return shape
    }
    
