Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/Tesselation/triangleintersectionlist.cpp

    rc29c0a rb8d215  
    132132    // if we have found one, check Scalarproduct between the vector
    133133    Vector TestVector = (Point) - (*(*runner).second);
    134     LOG(1, "INFO: Distance vector between point " << Point
     134    LOG(4, "DEBUG: Distance vector between point " << Point
    135135        << " and triangle intersection at " << (*(*runner).second) << " is "
    136136        << TestVector << ".");
    137137    if (fabs(TestVector.NormSquared()) < MYEPSILON)  {//
    138       LOG(1, "ACCEPT: Point is on the intersected triangle.");
     138      LOG(3, "ACCEPT: Point is on the intersected triangle.");
    139139      return true;
    140140    }
    141141    const double sign = (*runner).first->NormalVector.ScalarProduct(TestVector);
    142     LOG(1, "INFO: Checking sign of SKP between Distance vector and triangle's NormalVector "
     142    LOG(4, "DEBUG: Checking sign of SKP between Distance vector and triangle's NormalVector "
    143143        << (*runner).first->NormalVector << ": " << sign << ".");
    144144    if (sign < 0) {
    145       LOG(1, "ACCEPT: Point lies on inner side of intersected triangle.");
     145      LOG(3, "ACCEPT: Point lies on inner side of intersected triangle.");
    146146      return true;
    147147    } else {
    148       LOG(1, "REJECT: Point lies on outer side of intersected triangle.");
     148      LOG(3, "REJECT: Point lies on outer side of intersected triangle.");
    149149      return false;
    150150    }
     
    224224      for (DistanceTriangleMap::const_iterator iter = DistanceRange.first;
    225225          iter != DistanceRange.second; ++iter) {
    226         LOG(3, "DEBUG: " << *(iter->second) << " is in the list with " << iter->first << ".");
     226        LOG(4, "DEBUG: " << *(iter->second) << " is in the list with " << iter->first << ".");
    227227        ++count;
    228228      }
    229       LOG(1, "INFO: There are " << count << " possible triangles at the smallest distance.");
     229      LOG(3, "INFO: There are " << count << " possible triangles at the smallest distance.");
    230230    }
    231231    // if there is more than one, check all of their normal vectors
     
    233233    // would be truely inside, all of the closest triangles would have to show
    234234    // their inner side
    235     LOG(1, "INFO: Looking for first SKP greater than zero ...");
     235    LOG(4, "DEBUG: Looking for first SKP greater than zero ...");
    236236    for (DistanceTriangleMap::const_iterator iter = DistanceRange.first;
    237237        iter != DistanceRange.second; ++iter) {
     
    241241      // construct SKP
    242242      const double sign = (*iter).second->NormalVector.ScalarProduct(TestVector);
    243       LOG(1, "INFO: Checking SKP of closest triangle " << *(iter->second) << " = " << sign << ".");
     243      LOG(4, "DEBUG: Checking SKP of closest triangle " << *(iter->second) << " = " << sign << ".");
    244244      // if positive return
    245245      if (sign > 0)
Note: See TracChangeset for help on using the changeset viewer.