Changes in src/Tesselation/triangleintersectionlist.cpp [c29c0a:b8d215]

File:

• src/Tesselation/triangleintersectionlist.cpp (modified) (4 diffs)

src/Tesselation/triangleintersectionlist.cpp

@@ -132 +132 @@
     // if we have found one, check Scalarproduct between the vector
     Vector TestVector = (Point) - (*(*runner).second);
-    LOG(1, "INFO: Distance vector between point " << Point
+    LOG(4, "DEBUG: Distance vector between point " << Point
         << " and triangle intersection at " << (*(*runner).second) << " is "
         << TestVector << ".");
     if (fabs(TestVector.NormSquared()) < MYEPSILON)  {//
-      LOG(1, "ACCEPT: Point is on the intersected triangle.");
+      LOG(3, "ACCEPT: Point is on the intersected triangle.");
       return true;
     }
     const double sign = (*runner).first->NormalVector.ScalarProduct(TestVector);
-    LOG(1, "INFO: Checking sign of SKP between Distance vector and triangle's NormalVector "
+    LOG(4, "DEBUG: Checking sign of SKP between Distance vector and triangle's NormalVector "
         << (*runner).first->NormalVector << ": " << sign << ".");
     if (sign < 0) {
-      LOG(1, "ACCEPT: Point lies on inner side of intersected triangle.");
+      LOG(3, "ACCEPT: Point lies on inner side of intersected triangle.");
       return true;
     } else {
-      LOG(1, "REJECT: Point lies on outer side of intersected triangle.");
+      LOG(3, "REJECT: Point lies on outer side of intersected triangle.");
       return false;
     }
@@ -224 +224 @@
       for (DistanceTriangleMap::const_iterator iter = DistanceRange.first;
           iter != DistanceRange.second; ++iter) {
-        LOG(3, "DEBUG: " << *(iter->second) << " is in the list with " << iter->first << ".");
+        LOG(4, "DEBUG: " << *(iter->second) << " is in the list with " << iter->first << ".");
         ++count;
       }
-      LOG(1, "INFO: There are " << count << " possible triangles at the smallest distance.");
+      LOG(3, "INFO: There are " << count << " possible triangles at the smallest distance.");
     }
     // if there is more than one, check all of their normal vectors
@@ -233 +233 @@
     // would be truely inside, all of the closest triangles would have to show
     // their inner side
-    LOG(1, "INFO: Looking for first SKP greater than zero ...");
+    LOG(4, "DEBUG: Looking for first SKP greater than zero ...");
     for (DistanceTriangleMap::const_iterator iter = DistanceRange.first;
         iter != DistanceRange.second; ++iter) {
@@ -241 +241 @@
       // construct SKP
       const double sign = (*iter).second->NormalVector.ScalarProduct(TestVector);
-      LOG(1, "INFO: Checking SKP of closest triangle " << *(iter->second) << " = " << sign << ".");
+      LOG(4, "DEBUG: Checking SKP of closest triangle " << *(iter->second) << " = " << sign << ".");
       // if positive return
       if (sign > 0)