return this.createNodes(b, x);
return createNodes(b, x);
    int splitIntersections(Segment b)    {      if (b instanceof LineSegment)	return (b.splitIntersections(this));      if (b instanceof CubicSegment)	return (b.splitIntersections(this));      if (b instanceof QuadSegment)        {	  // Use the cubic-cubic intersection routine for quads as well,	  // Since a quadratic can be exactly described as a cubic, this	  // should not be a problem; 	  // The recursion depth will be the same in any case.	  Intersection[] x = cubicCubicIntersect(getCubicSegment(),	                                         ((QuadSegment) b)	                                         .getCubicSegment());	  if (x == null)	    return 0;	  if (x.length == 1)	    return createNode(b, (Intersection) x[0]);	  return this.createNodes(b, x);        }      return 0;    }