Changes in src/tesselationhelpers.cpp [797126:bdc91e]

File:

• src/tesselationhelpers.cpp (modified) (5 diffs)

src/tesselationhelpers.cpp

@@ -21 +21 @@
 #include "verbose.hpp"
 #include "Plane.hpp"
-#include "Matrix.hpp"
+
+double DetGet(gsl_matrix * const A, const int inPlace)
+{
+        Info FunctionInfo(__func__);
+  /*
+  inPlace = 1 => A is replaced with the LU decomposed copy.
+  inPlace = 0 => A is retained, and a copy is used for LU.
+  */
+
+  double det;
+  int signum;
+  gsl_permutation *p = gsl_permutation_alloc(A->size1);
+  gsl_matrix *tmpA=0;
+
+  if (inPlace)
+  tmpA = A;
+  else {
+  gsl_matrix *tmpA = gsl_matrix_alloc(A->size1, A->size2);
+  gsl_matrix_memcpy(tmpA , A);
+  }
+
+
+  gsl_linalg_LU_decomp(tmpA , p , &signum);
+  det = gsl_linalg_LU_det(tmpA , signum);
+  gsl_permutation_free(p);
+  if (! inPlace)
+  gsl_matrix_free(tmpA);
+
+  return det;
+};
 
 void GetSphere(Vector * const center, const Vector &a, const Vector &b, const Vector &c, const double RADIUS)
 {
         Info FunctionInfo(__func__);
-  Matrix mat;
+  gsl_matrix *A = gsl_matrix_calloc(3,3);
   double m11, m12, m13, m14;
 
   for(int i=0;i<3;i++) {
-    mat.set(i, 0, a[i]);
-    mat.set(i, 1, b[i]);
-    mat.set(i, 2, c[i]);
-  }
-  m11 = mat.determinant();
+    gsl_matrix_set(A, i, 0, a[i]);
+    gsl_matrix_set(A, i, 1, b[i]);
+    gsl_matrix_set(A, i, 2, c[i]);
+  }
+  m11 = DetGet(A, 1);
 
   for(int i=0;i<3;i++) {
-    mat.set(i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
-    mat.set(i, 1, b[i]);
-    mat.set(i, 2, c[i]);
-  }
-  m12 = mat.determinant();
+    gsl_matrix_set(A, i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
+    gsl_matrix_set(A, i, 1, b[i]);
+    gsl_matrix_set(A, i, 2, c[i]);
+  }
+  m12 = DetGet(A, 1);
 
   for(int i=0;i<3;i++) {
-    mat.set(i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
-    mat.set(i, 1, a[i]);
-    mat.set(i, 2, c[i]);
-  }
-  m13 = mat.determinant();
+    gsl_matrix_set(A, i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
+    gsl_matrix_set(A, i, 1, a[i]);
+    gsl_matrix_set(A, i, 2, c[i]);
+  }
+  m13 = DetGet(A, 1);
 
   for(int i=0;i<3;i++) {
-    mat.set(i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
-    mat.set(i, 1, a[i]);
-    mat.set(i, 2, b[i]);
-  }
-  m14 = mat.determinant();
+    gsl_matrix_set(A, i, 0, a[i]*a[i] + b[i]*b[i] + c[i]*c[i]);
+    gsl_matrix_set(A, i, 1, a[i]);
+    gsl_matrix_set(A, i, 2, b[i]);
+  }
+  m14 = DetGet(A, 1);
 
   if (fabs(m11) < MYEPSILON)
@@ -66 +95 @@
   if (fabs(a.distance(*center) - RADIUS) > MYEPSILON)
     DoeLog(1) && (eLog()<< Verbose(1) << "The given center is further way by " << fabs(a.distance(*center) - RADIUS) << " from a than RADIUS." << endl);
+
+  gsl_matrix_free(A);
 };
 
@@ -217 +248 @@
   Vector x3;
   Vector x4;
+};
+
+/**
+ * Intersection calculation function.
+ *
+ * @param x to find the result for
+ * @param function parameter
+ */
+double MinIntersectDistance(const gsl_vector * x, void *params)
+{
+        Info FunctionInfo(__func__);
+  double retval = 0;
+  struct Intersection *I = (struct Intersection *)params;
+  Vector intersection;
+  for (int i=0;i<NDIM;i++)
+    intersection[i] = gsl_vector_get(x, i);
+
+  Vector SideA = I->x1 -I->x2 ;
+  Vector HeightA = intersection - I->x1;
+  HeightA.ProjectOntoPlane(SideA);
+
+  Vector SideB = I->x3 - I->x4;
+  Vector HeightB = intersection - I->x3;
+  HeightB.ProjectOntoPlane(SideB);
+
+  retval = HeightA.ScalarProduct(HeightA) + HeightB.ScalarProduct(HeightB);
+  //Log() << Verbose(1) << "MinIntersectDistance called, result: " << retval << endl;
+
+  return retval;
+};
+
+
+/**
+ * Calculates whether there is an intersection between two lines. The first line
+ * always goes through point 1 and point 2 and the second line is given by the
+ * connection between point 4 and point 5.
+ *
+ * @param point 1 of line 1
+ * @param point 2 of line 1
+ * @param point 1 of line 2
+ * @param point 2 of line 2
+ *
+ * @return true if there is an intersection between the given lines, false otherwise
+ */
+bool existsIntersection(const Vector &point1, const Vector &point2, const Vector &point3, const Vector &point4)
+{
+        Info FunctionInfo(__func__);
+  bool result;
+
+  struct Intersection par;
+    par.x1 = point1;
+    par.x2 = point2;
+    par.x3 = point3;
+    par.x4 = point4;
+
+    const gsl_multimin_fminimizer_type *T = gsl_multimin_fminimizer_nmsimplex;
+    gsl_multimin_fminimizer *s = NULL;
+    gsl_vector *ss, *x;
+    gsl_multimin_function minexFunction;
+
+    size_t iter = 0;
+    int status;
+    double size;
+
+    /* Starting point */
+    x = gsl_vector_alloc(NDIM);
+    gsl_vector_set(x, 0, point1[0]);
+    gsl_vector_set(x, 1, point1[1]);
+    gsl_vector_set(x, 2, point1[2]);
+
+    /* Set initial step sizes to 1 */
+    ss = gsl_vector_alloc(NDIM);
+    gsl_vector_set_all(ss, 1.0);
+
+    /* Initialize method and iterate */
+    minexFunction.n = NDIM;
+    minexFunction.f = &MinIntersectDistance;
+    minexFunction.params = (void *)&par;
+
+    s = gsl_multimin_fminimizer_alloc(T, NDIM);
+    gsl_multimin_fminimizer_set(s, &minexFunction, x, ss);
+
+    do {
+        iter++;
+        status = gsl_multimin_fminimizer_iterate(s);
+
+        if (status) {
+          break;
+        }
+
+        size = gsl_multimin_fminimizer_size(s);
+        status = gsl_multimin_test_size(size, 1e-2);
+
+        if (status == GSL_SUCCESS) {
+          DoLog(1) && (Log() << Verbose(1) << "converged to minimum" <<  endl);
+        }
+    } while (status == GSL_CONTINUE && iter < 100);
+
+    // check whether intersection is in between or not
+  Vector intersection;
+  double t1, t2;
+  for (int i = 0; i < NDIM; i++) {
+    intersection[i] = gsl_vector_get(s->x, i);
+  }
+
+  Vector SideA = par.x2 - par.x1;
+  Vector HeightA = intersection - par.x1;
+
+  t1 = HeightA.ScalarProduct(SideA)/SideA.ScalarProduct(SideA);
+
+  Vector SideB = par.x4 - par.x3;
+  Vector HeightB = intersection - par.x3;
+
+  t2 = HeightB.ScalarProduct(SideB)/SideB.ScalarProduct(SideB);
+
+  Log() << Verbose(1) << "Intersection " << intersection << " is at "
+    << t1 << " for (" << point1 << "," << point2 << ") and at "
+    << t2 << " for (" << point3 << "," << point4 << "): ";
+
+  if (((t1 >= 0) && (t1 <= 1)) && ((t2 >= 0) && (t2 <= 1))) {
+    DoLog(1) && (Log() << Verbose(1) << "true intersection." << endl);
+    result = true;
+  } else {
+    DoLog(1) && (Log() << Verbose(1) << "intersection out of region of interest." << endl);
+    result = false;
+  }
+
+  // free minimizer stuff
+    gsl_vector_free(x);
+    gsl_vector_free(ss);
+    gsl_multimin_fminimizer_free(s);
+
+  return result;
 };
 
@@ -425 +589 @@
           }
         } else {
-          eLog() << Verbose(1) << "The current cell " << LC->n[0] << "," << LC->n[1] << ","
-            << LC->n[2] << " is invalid!" << endl;
+          DoeLog(1) && (eLog() << Verbose(1) << "The current cell " << LC->n[0] << "," << LC->n[1] << "," << LC->n[2] << " is invalid!" << endl);
         }
       }
@@ -481 +644 @@
           }
         } else {
-          eLog() << Verbose(1) << "The current cell " << LC->n[0] << "," << LC->n[1] << ","
-            << LC->n[2] << " is invalid!" << endl;
+          DoeLog(1) && (eLog() << Verbose(1) << "The current cell " << LC->n[0] << "," << LC->n[1] << "," << LC->n[2] << " is invalid!" << endl);
         }
       }