del

src/experimental/_impl/_convex_intersection_for_impl.scad

@@ -1,10 +0,0 @@
-use <experimental/convex_intersection.scad>;
-
-function _convex_intersection_for(shapes, pre, leng, i = 2) = 
-    i == leng ? pre :
-    let(r = convex_intersection(pre, shapes[i]))
-    r == [] ? [] 
-            : _convex_intersection_for(shapes, 
-                  r, 
-                  leng, i + 1
-              );

src/experimental/_impl/_convex_intersection_impl.scad

@@ -1,12 +0,0 @@
-use <lines_intersection.scad>;
-
-function _intersection_ps(shape, line_pts, epsilon) = 
-    let(
-        leng = len(shape),
-        pts = [each shape, shape[0]]
-    )
-    [
-        for(i = [0:leng - 1]) 
-        let(p = lines_intersection(line_pts, [pts[i], pts[i + 1]], epsilon = epsilon))
-        if(p != []) p
-    ];

src/experimental/convex_intersection.scad

@@ -1,17 +0,0 @@
-
-use <in_shape.scad>;
-use <experimental/_impl/_convex_intersection_impl.scad>;
-use <experimental/convex_ct_clk_order.scad>;
-
-function convex_intersection(shape1, shape2, epsilon = 0.0001) =
-    (shape1 == [] || shape2 == []) ? [] :
-    let(
-        leng = len(shape1),
-        convex = concat(
-            [for(p = shape1) if(in_shape(shape2, p, include_edge = true)) p], 
-            [for(p = shape2) if(in_shape(shape1, p, include_edge = true)) p],
-            [for(i = [0:leng - 1]) each _intersection_ps(shape2, [shape1[i], shape1[i + 1]], epsilon)],
-            _intersection_ps(shape2, [shape1[len(shape1) - 1], shape1[0]], epsilon)
-        )
-    )
-    convex == [] ? [] : convex_ct_clk_order(convex);  

src/experimental/convex_intersection_for.scad

@@ -1,10 +0,0 @@
-use <experimental/convex_intersection.scad>;
-use <experimental/_impl/_convex_intersection_for_impl.scad>;
-                
-function convex_intersection_for(shapes) = 
-    let(leng = len(shapes))
-    _convex_intersection_for(
-        shapes, 
-        convex_intersection(shapes[0], shapes[1]), 
-        leng
-    );