- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Tesselation/triangleintersectionlist.cpp
rc29c0a rb8d215 132 132 // if we have found one, check Scalarproduct between the vector 133 133 Vector TestVector = (Point) - (*(*runner).second); 134 LOG( 1, "INFO: Distance vector between point " << Point134 LOG(4, "DEBUG: Distance vector between point " << Point 135 135 << " and triangle intersection at " << (*(*runner).second) << " is " 136 136 << TestVector << "."); 137 137 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."); 139 139 return true; 140 140 } 141 141 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 " 143 143 << (*runner).first->NormalVector << ": " << sign << "."); 144 144 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."); 146 146 return true; 147 147 } 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."); 149 149 return false; 150 150 } … … 224 224 for (DistanceTriangleMap::const_iterator iter = DistanceRange.first; 225 225 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 << "."); 227 227 ++count; 228 228 } 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."); 230 230 } 231 231 // 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 234 234 // 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 ..."); 236 236 for (DistanceTriangleMap::const_iterator iter = DistanceRange.first; 237 237 iter != DistanceRange.second; ++iter) { … … 241 241 // construct SKP 242 242 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 << "."); 244 244 // if positive return 245 245 if (sign > 0)
Note:
See TracChangeset
for help on using the changeset viewer.