Add recursion bound

Author: TrueDoctor

libraries/path-bool/src/intersection_path_segment.rs

@@ -116,24 +116,33 @@ pub fn path_segment_intersection(seg0: &PathSegment, seg1: &PathSegment, endpoin
 	let mut subdivided0 = Vec::new();
 	let mut subdivided1 = Vec::new();
 
+	// check if start and end points are on the other bezier curves. If so, add as intersection.
+
 	while !pairs.is_empty() {
 		next_pairs.clear();
-		dbg!("checking pairs");
+		// dbg!("checking pairs");
+
+		if pairs.len() > 1000 {
+			return vec![];
+		}
 
 		for (seg0, seg1) in pairs.iter() {
 			if segments_equal(&seg0.seg, &seg1.seg, eps.point) {
 				// TODO: move this outside of this loop?
 				continue; // TODO: what to do?
 			}
 
-			let is_linear0 = bounding_box_max_extent(&seg0.bounding_box) <= eps.linear || (seg1.end_param - seg1.start_param).abs() < eps.param;
+			let diff1 = (seg0.start_param - seg0.end_param).abs();
+			let diff2 = (seg1.start_param - seg1.end_param).abs();
+			// dbg!(diff1.min(diff2));
+			let is_linear0 = bounding_box_max_extent(&seg0.bounding_box) <= eps.linear || (seg0.end_param - seg0.start_param).abs() < eps.param;
 			let is_linear1 = bounding_box_max_extent(&seg1.bounding_box) <= eps.linear || (seg1.end_param - seg1.start_param).abs() < eps.param;
 
 			if is_linear0 && is_linear1 {
 				let line_segment0 = path_segment_to_line_segment(&seg0.seg);
 				let line_segment1 = path_segment_to_line_segment(&seg1.seg);
 				if let Some(st) = line_segment_intersection(line_segment0, line_segment1, eps.param) {
-					dbg!("pushing param");
+					// dbg!("pushing param");
 					params.push([lerp(seg0.start_param, seg0.end_param, st.0), lerp(seg1.start_param, seg1.end_param, st.1)]);
 				}
 			} else {

libraries/path-bool/src/path_boolean.rs

@@ -1313,7 +1313,6 @@ pub enum BooleanError {
 }
 
 pub fn path_boolean(a: &Path, a_fill_rule: FillRule, b: &Path, b_fill_rule: FillRule, op: PathBooleanOperation) -> Result<Vec<Path>, BooleanError> {
-	eprintln!("converting to edges");
 	let mut unsplit_edges: Vec<MajorGraphEdgeStage1> = a.iter().map(segment_to_edge(1)).chain(b.iter().map(segment_to_edge(2))).flatten().collect();
 
 	split_at_self_intersections(&mut unsplit_edges);