Changeset b8d215 for src/Tesselation/triangleintersectionlist.cpp

Timestamp:

Oct 19, 2014, 5:13:10 PM (10 years ago)

Author:

Frederik Heber <heber@…>

Branches:

Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Added_ParseSaveFragmentResults, AddingActions_SaveParseParticleParameters, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_ParticleName_to_Atom, Adding_StructOpt_integration_tests, AtomFragments, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, CombiningParticlePotentialParsing, Combining_Subpackages, Debian_Package_split, Debian_package_split_molecuildergui_only, Disabling_MemDebug, Docu_Python_wait, EmpiricalPotential_contain_HomologyGraph, EmpiricalPotential_contain_HomologyGraph_documentation, Enable_parallel_make_install, Enhance_userguide, Enhanced_StructuralOptimization, Enhanced_StructuralOptimization_continued, Example_ManyWaysToTranslateAtom, Exclude_Hydrogens_annealWithBondGraph, FitPartialCharges_GlobalError, Fix_BoundInBox_CenterInBox_MoleculeActions, Fix_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_PopActions, Fix_QtFragmentList_sorted_selection, Fix_Restrictedkeyset_FragmentMolecule, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, Fix_fitting_potentials, Fixes, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, FragmentAction_writes_AtomFragments, FragmentMolecule_checks_bonddegrees, GeometryObjects, Gui_Fixes, Gui_displays_atomic_force_velocity, ImplicitCharges, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, MoreRobust_FragmentAutomation, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PdbParser_setsAtomName, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, Rewrite_FitPartialCharges, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, SaturateAtoms_singleDegree, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, Switchable_LogView, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, TremoloParser_setsAtomName, Ubuntu_1604_changes, stable

Children:

6d5280

Parents:

dfe054

git-author:

Frederik Heber <heber@…> (09/25/14 18:26:03)

git-committer:

Frederik Heber <heber@…> (10/19/14 17:13:10)

Message:

Changed some verbosities in Tesselation code.

• modifications in BoundaryPointSet, BoundaryLineSet, BoundaryTriangleSet.
• also to CandidateForTesselation, TriangleIntersectionList, tesselation, tesselation helpers and boundary code.

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)