@@ -836,8 +836,7 @@ inline bool segments_intersect(const double &x1,
836
836
// If den == 0 we have two possibilities:
837
837
if (isclose (den, 0.0 )) {
838
838
float t_area = (x2*y3 - x3*y2) - x1*(y3 - y2) + y1*(x3 - x2);
839
- printf (" t_area: %f\n " , t_area);
840
- // 1 - If the area of the triangle made by the 3 first points (2 from the first segment
839
+ // 1 - If the area of the triangle made by the 3 first points (2 from the first segment
841
840
// plus one from the second) is zero, they are collinear
842
841
if (isclose (t_area, 0.0 )) {
843
842
if (x1 == x2 && x2 == x3) { // segments have infinite slope (vertical lines)
@@ -904,15 +903,6 @@ bool path_intersects_path(PathIterator1 &p1, PathIterator2 &p2)
904
903
if ((isclose ((x21 - x22) * (x21 - x22) + (y21 - y22) * (y21 - y22), 0 ))){
905
904
continue ;
906
905
}
907
- // xx printf("\nsegment 1:\n");
908
- // xx printf("( %4.2f, %4.2f )", x11, y11);
909
- // xx printf("( %4.2f, %4.2f )", x12, y12);
910
-
911
- // xx printf("\nsegment 2:\n");
912
- // xx printf("( %4.2f, %4.2f )", x21, y21);
913
- // xx printf("( %4.2f, %4.2f )", x22, y22);
914
-
915
- // xx printf("intersects? %d", segments_intersect(x11, y11, x12, y12, x21, y21, x22, y22));
916
906
917
907
if (segments_intersect (x11, y11, x12, y12, x21, y21, x22, y22)) {
918
908
return true ;
0 commit comments