From e222d261360483f0bf8eb88013b0ce7a2098a1f3 Mon Sep 17 00:00:00 2001
From: Adrian Mariano <avm4@cornell.edu>
Date: Tue, 28 Jul 2020 17:55:56 -0400
Subject: [PATCH] Removed unneeded functions

---
 geometry.scad | 33 ---------------------------------
 1 file changed, 33 deletions(-)

diff --git a/geometry.scad b/geometry.scad
index 168a91d..443c026 100644
--- a/geometry.scad
+++ b/geometry.scad
@@ -1341,18 +1341,6 @@ function circle_circle_tangents(c1,r1,c2,r2,d1,d2) =
 
 // Section: Pointlists
 
-// Function: first_noncollinear()
-// Usage:
-//   first_noncollinear(i1, i2, points);
-// Description:
-//   Returns index of the first point in `points` that is not collinear with the points indexed by `i1` and `i2`.
-// Arguments:
-//   i1 = The first point.
-//   i2 = The second point.
-//   points = The list of points to find a non-collinear point from.
-function first_noncollinear(i1, i2, points) =
-    [for (j = idx(points)) if (j!=i1 && j!=i2 && !collinear_indexed(points,i1,i2,j)) j][0];
-
 
 // Function: find_noncollinear_points()
 // Usage:
@@ -1373,27 +1361,6 @@ function find_noncollinear_points(points,error=true,eps=EPSILON) =
       []
     : [0,b,max_index(distlist)];
 
-function old_find_noncollinear_points(points,error=true) =
-    let(
-        a = 0,
-        b = furthest_point(points[a], points),
-        pa = points[a],
-        pb = points[b],
-        c = max_index([
-            for (p=points) 
-                (approx(p,pa) || approx(p,pb))? 0 :
-                let(score = 
-                      sin(vector_angle(points[a]-p,points[b]-p)) *
-                      norm(p-points[a]) * norm(p-points[b]),fff=echo(score=score))
-                approx(score,0,eps=1e-7) ? -1 : score])
-        ,foo=echo(pval = a,b,c)
-        )
-    
-    c ==a || c==b
-    ? assert(!error, "Cannot find three noncollinear points in pointlist.")
-      []
-    : [a, b, c];
-
 
 // Function: pointlist_bounds()
 // Usage: