Changeset e138de for src/tesselation.cpp

Timestamp:

Nov 4, 2009, 7:56:04 PM (16 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:

1614174, e5ad5c

Parents:

7326b2

Message:

Huge change from ofstream * (const) out --> Log().

• first shift was done via regular expressions
• then via error messages from the code
• note that class atom, class element and class molecule kept in parts their output stream, was they print to file.
• make check runs fine
• MISSING: Verbosity is not fixed for everything (i.e. if no endl; is present and next has Verbose(0) ...)

Signed-off-by: Frederik Heber <heber@…>

File:

• src/tesselation.cpp (modified) (187 diffs)

src/tesselation.cpp

@@ -10 +10 @@
 #include "helpers.hpp"
 #include "linkedcell.hpp"
+#include "log.hpp"
 #include "tesselation.hpp"
 #include "tesselationhelpers.hpp"
@@ -45 +46 @@
 BoundaryPointSet::~BoundaryPointSet()
 {
-  //cout << Verbose(5) << "Erasing point nr. " << Nr << "." << endl;
+  //Log() << Verbose(5) << "Erasing point nr. " << Nr << "." << endl;
   if (!lines.empty())
-    cerr << "WARNING: Memory Leak! I " << *this << " am still connected to some lines." << endl;
+    eLog() << Verbose(0) << "WARNING: Memory Leak! I " << *this << " am still connected to some lines." << endl;
   node = NULL;
 };
@@ -56 +57 @@
 void BoundaryPointSet::AddLine(class BoundaryLineSet *line)
 {
-  cout << Verbose(6) << "Adding " << *this << " to line " << *line << "."
+  Log() << Verbose(6) << "Adding " << *this << " to line " << *line << "."
       << endl;
   if (line->endpoints[0] == this)
@@ -106 +107 @@
   Point[1]->AddLine(this); //
   // clear triangles list
-  cout << Verbose(5) << "New Line with endpoints " << *this << "." << endl;
+  Log() << Verbose(5) << "New Line with endpoints " << *this << "." << endl;
 };
 
@@ -133 +134 @@
         for (LineMap::iterator Runner = erasor.first; Runner != erasor.second; Runner++)
           if ((*Runner).second == this) {
-            //cout << Verbose(5) << "Removing Line Nr. " << Nr << " in boundary point " << *endpoints[i] << "." << endl;
+            //Log() << Verbose(5) << "Removing Line Nr. " << Nr << " in boundary point " << *endpoints[i] << "." << endl;
             endpoints[i]->lines.erase(Runner);
             break;
@@ -139 +140 @@
       } else { // there's just a single line left
         if (endpoints[i]->lines.erase(Nr)) {
-          //cout << Verbose(5) << "Removing Line Nr. " << Nr << " in boundary point " << *endpoints[i] << "." << endl;
+          //Log() << Verbose(5) << "Removing Line Nr. " << Nr << " in boundary point " << *endpoints[i] << "." << endl;
         }
       }
       if (endpoints[i]->lines.empty()) {
-        //cout << Verbose(5) << *endpoints[i] << " has no more lines it's attached to, erasing." << endl;
+        //Log() << Verbose(5) << *endpoints[i] << " has no more lines it's attached to, erasing." << endl;
         if (endpoints[i] != NULL) {
           delete(endpoints[i]);
@@ -152 +153 @@
   }
   if (!triangles.empty())
-    cerr << "WARNING: Memory Leak! I " << *this << " am still connected to some triangles." << endl;
+    eLog() << Verbose(0) << "WARNING: Memory Leak! I " << *this << " am still connected to some triangles." << endl;
 };
 
@@ -160 +161 @@
 void BoundaryLineSet::AddTriangle(class BoundaryTriangleSet *triangle)
 {
-  cout << Verbose(6) << "Add " << triangle->Nr << " to line " << *this << "." << endl;
+  Log() << Verbose(6) << "Add " << triangle->Nr << " to line " << *this << "." << endl;
   triangles.insert(TrianglePair(triangle->Nr, triangle));
 };
@@ -182 +183 @@
  * \return true - triangles are convex, false - concave or less than two triangles connected
  */
-bool BoundaryLineSet::CheckConvexityCriterion(ofstream *out)
+bool BoundaryLineSet::CheckConvexityCriterion()
 {
   Vector BaseLineCenter, BaseLineNormal, BaseLine, helper[2], NormalCheck;
   // get the two triangles
   if (triangles.size() != 2) {
-    *out << Verbose(1) << "ERROR: Baseline " << *this << " is connected to less than two triangles, Tesselation incomplete!" << endl;
+    Log() << Verbose(1) << "ERROR: Baseline " << *this << " is connected to less than two triangles, Tesselation incomplete!" << endl;
     return true;
   }
   // check normal vectors
   // have a normal vector on the base line pointing outwards
-  //*out << Verbose(3) << "INFO: " << *this << " has vectors at " << *(endpoints[0]->node->node) << " and at " << *(endpoints[1]->node->node) << "." << endl;
+  //Log() << Verbose(3) << "INFO: " << *this << " has vectors at " << *(endpoints[0]->node->node) << " and at " << *(endpoints[1]->node->node) << "." << endl;
   BaseLineCenter.CopyVector(endpoints[0]->node->node);
   BaseLineCenter.AddVector(endpoints[1]->node->node);
@@ -198 +199 @@
   BaseLine.CopyVector(endpoints[0]->node->node);
   BaseLine.SubtractVector(endpoints[1]->node->node);
-  //*out << Verbose(3) << "INFO: Baseline is " << BaseLine << " and its center is at " << BaseLineCenter << "." << endl;
+  //Log() << Verbose(3) << "INFO: Baseline is " << BaseLine << " and its center is at " << BaseLineCenter << "." << endl;
 
   BaseLineNormal.Zero();
@@ -206 +207 @@
   class BoundaryPointSet *node = NULL;
   for(TriangleMap::iterator runner = triangles.begin(); runner != triangles.end(); runner++) {
-    //*out << Verbose(3) << "INFO: NormalVector of " << *(runner->second) << " is " << runner->second->NormalVector << "." << endl;
+    //Log() << Verbose(3) << "INFO: NormalVector of " << *(runner->second) << " is " << runner->second->NormalVector << "." << endl;
     NormalCheck.AddVector(&runner->second->NormalVector);
     NormalCheck.Scale(sign);
@@ -213 +214 @@
       BaseLineNormal.CopyVector(&runner->second->NormalVector);   // yes, copy second on top of first
     else {
-      *out << Verbose(1) << "CRITICAL: Triangle " << *runner->second << " has zero normal vector!" << endl;
+      Log() << Verbose(1) << "CRITICAL: Triangle " << *runner->second << " has zero normal vector!" << endl;
       exit(255);
     }
     node = runner->second->GetThirdEndpoint(this);
     if (node != NULL) {
-      //*out << Verbose(3) << "INFO: Third node for triangle " << *(runner->second) << " is " << *node << " at " << *(node->node->node) << "." << endl;
+      //Log() << Verbose(3) << "INFO: Third node for triangle " << *(runner->second) << " is " << *node << " at " << *(node->node->node) << "." << endl;
       helper[i].CopyVector(node->node->node);
       helper[i].SubtractVector(&BaseLineCenter);
       helper[i].MakeNormalVector(&BaseLine);  // we want to compare the triangle's heights' angles!
-      //*out << Verbose(4) << "INFO: Height vector with respect to baseline is " << helper[i] << "." << endl;
+      //Log() << Verbose(4) << "INFO: Height vector with respect to baseline is " << helper[i] << "." << endl;
       i++;
     } else {
-      //*out << Verbose(2) << "ERROR: I cannot find third node in triangle, something's wrong." << endl;
+      //Log() << Verbose(2) << "ERROR: I cannot find third node in triangle, something's wrong." << endl;
       return true;
     }
   }
-  //*out << Verbose(3) << "INFO: BaselineNormal is " << BaseLineNormal << "." << endl;
+  //Log() << Verbose(3) << "INFO: BaselineNormal is " << BaseLineNormal << "." << endl;
   if (NormalCheck.NormSquared() < MYEPSILON) {
-    *out << Verbose(3) << "ACCEPT: Normalvectors of both triangles are the same: convex." << endl;
+    Log() << Verbose(3) << "ACCEPT: Normalvectors of both triangles are the same: convex." << endl;
     return true;
   }
@@ -237 +238 @@
   double angle = GetAngle(helper[0], helper[1], BaseLineNormal);
   if ((angle - M_PI) > -MYEPSILON) {
-    *out << Verbose(3) << "ACCEPT: Angle is greater than pi: convex." << endl;
+    Log() << Verbose(3) << "ACCEPT: Angle is greater than pi: convex." << endl;
     return true;
   } else {
-    *out << Verbose(3) << "REJECT: Angle is less than pi: concave." << endl;
+    Log() << Verbose(3) << "REJECT: Angle is less than pi: concave." << endl;
     return false;
   }
@@ -304 +305 @@
   Nr = number;
   // set lines
-  cout << Verbose(5) << "New triangle " << Nr << ":" << endl;
+  Log() << Verbose(5) << "New triangle " << Nr << ":" << endl;
   for (int i = 0; i < 3; i++)
     {
@@ -322 +323 @@
   // set endpoints
   int Counter = 0;
-  cout << Verbose(6) << " with end points ";
+  Log() << Verbose(6) << " with end points ";
   for (map<int, class BoundaryPointSet *>::iterator runner = OrderMap.begin(); runner
       != OrderMap.end(); runner++)
     {
       endpoints[Counter] = runner->second;
-      cout << " " << *endpoints[Counter];
+      Log() << Verbose(0) << " " << *endpoints[Counter];
       Counter++;
     }
   if (Counter < 3)
     {
-      cerr << "ERROR! We have a triangle with only two distinct endpoints!"
+      eLog() << Verbose(0) << "ERROR! We have a triangle with only two distinct endpoints!"
           << endl;
       //exit(1);
     }
-  cout << "." << endl;
+  Log() << Verbose(0) << "." << endl;
 };
 
@@ -348 +349 @@
     if (lines[i] != NULL) {
       if (lines[i]->triangles.erase(Nr)) {
-        //cout << Verbose(5) << "Triangle Nr." << Nr << " erased in line " << *lines[i] << "." << endl;
+        //Log() << Verbose(5) << "Triangle Nr." << Nr << " erased in line " << *lines[i] << "." << endl;
       }
       if (lines[i]->triangles.empty()) {
-          //cout << Verbose(5) << *lines[i] << " is no more attached to any triangle, erasing." << endl;
+          //Log() << Verbose(5) << *lines[i] << " is no more attached to any triangle, erasing." << endl;
           delete (lines[i]);
           lines[i] = NULL;
@@ -357 +358 @@
     }
   }
-  //cout << Verbose(5) << "Erasing triangle Nr." << Nr << " itself." << endl;
+  //Log() << Verbose(5) << "Erasing triangle Nr." << Nr << " itself." << endl;
 };
 
@@ -386 +387 @@
  * \return true - \a *Intersection contains intersection on plane defined by triangle, false - zero vector if outside of triangle.
  */
-bool BoundaryTriangleSet::GetIntersectionInsideTriangle(ofstream *out, Vector *MolCenter, Vector *x, Vector *Intersection)
+bool BoundaryTriangleSet::GetIntersectionInsideTriangle(Vector *MolCenter, Vector *x, Vector *Intersection)
 {
   Vector CrossPoint;
   Vector helper;
 
-  if (!Intersection->GetIntersectionWithPlane(out, &NormalVector, endpoints[0]->node->node, MolCenter, x)) {
-    *out << Verbose(1) << "Alas! Intersection with plane failed - at least numerically - the intersection is not on the plane!" << endl;
+  if (!Intersection->GetIntersectionWithPlane(&NormalVector, endpoints[0]->node->node, MolCenter, x)) {
+    Log() << Verbose(1) << "Alas! Intersection with plane failed - at least numerically - the intersection is not on the plane!" << endl;
     return false;
   }
@@ -399 +400 @@
   int i=0;
   do {
-    if (CrossPoint.GetIntersectionOfTwoLinesOnPlane(out, endpoints[i%3]->node->node, endpoints[(i+1)%3]->node->node, endpoints[(i+2)%3]->node->node, Intersection, &NormalVector)) {
+    if (CrossPoint.GetIntersectionOfTwoLinesOnPlane(endpoints[i%3]->node->node, endpoints[(i+1)%3]->node->node, endpoints[(i+2)%3]->node->node, Intersection, &NormalVector)) {
       helper.CopyVector(endpoints[(i+1)%3]->node->node);
       helper.SubtractVector(endpoints[i%3]->node->node);
@@ -408 +409 @@
   } while (CrossPoint.NormSquared() < MYEPSILON);
   if (i==3) {
-    *out << Verbose(1) << "ERROR: Could not find any cross points, something's utterly wrong here!" << endl;
+    Log() << Verbose(1) << "ERROR: Could not find any cross points, something's utterly wrong here!" << endl;
     exit(255);
   }
@@ -627 +628 @@
 Tesselation::~Tesselation()
 {
-  cout << Verbose(1) << "Free'ing TesselStruct ... " << endl;
+  Log() << Verbose(1) << "Free'ing TesselStruct ... " << endl;
   for (TriangleMap::iterator runner = TrianglesOnBoundary.begin(); runner != TrianglesOnBoundary.end(); runner++) {
     if (runner->second != NULL) {
@@ -633 +634 @@
       runner->second = NULL;
     } else
-      cerr << "ERROR: The triangle " << runner->first << " has already been free'd." << endl;
-  }
-  cout << "This envelope was written to file " << TriangleFilesWritten << " times(s)." << endl;
+      eLog() << Verbose(1) << "ERROR: The triangle " << runner->first << " has already been free'd." << endl;
+  }
+  Log() << Verbose(1) << "This envelope was written to file " << TriangleFilesWritten << " times(s)." << endl;
 }
 ;
@@ -730 +731 @@
  */
 void
-Tesselation::GuessStartingTriangle(ofstream *out)
+Tesselation::GuessStartingTriangle()
 {
   // 4b. create a starting triangle
@@ -762 +763 @@
     }
   //    // listing distances
-  //    *out << Verbose(1) << "Listing DistanceMMap:";
+  //    Log() << Verbose(1) << "Listing DistanceMMap:";
   //    for(DistanceMultiMap::iterator runner = DistanceMMap.begin(); runner != DistanceMMap.end(); runner++) {
-  //      *out << " " << runner->first << "(" << *runner->second.first->second << ", " << *runner->second.second->second << ")";
+  //      Log() << Verbose(0) << " " << runner->first << "(" << *runner->second.first->second << ", " << *runner->second.second->second << ")";
   //    }
-  //    *out << endl;
+  //    Log() << Verbose(0) << endl;
   // 4b2. pick three baselines forming a triangle
   // 1. we take from the smallest sum of squared distance as the base line BC (with peak A) onward as the triangle candidate
@@ -778 +779 @@
           baseline->second.first->second->node->node,
           baseline->second.second->second->node->node);
-      *out << Verbose(2) << "Plane vector of candidate triangle is ";
-      PlaneVector.Output(out);
-      *out << endl;
+      Log() << Verbose(2) << "Plane vector of candidate triangle is ";
+      PlaneVector.Output();
+      Log() << Verbose(0) << endl;
       // 4. loop over all points
       double sign = 0.;
@@ -796 +797 @@
           if (fabs(distance) < 1e-4) // we need to have a small epsilon around 0 which is still ok
             continue;
-          *out << Verbose(3) << "Projection of " << checker->second->node->Name
+          Log() << Verbose(3) << "Projection of " << checker->second->node->Name
               << " yields distance of " << distance << "." << endl;
           tmp = distance / fabs(distance);
@@ -803 +804 @@
             {
               // 4c. If so, break 4. loop and continue with next candidate in 1. loop
-              *out << Verbose(2) << "Current candidates: "
+              Log() << Verbose(2) << "Current candidates: "
                   << A->second->node->Name << ","
                   << baseline->second.first->second->node->Name << ","
@@ -813 +814 @@
           else
             { // note the sign for later
-              *out << Verbose(2) << "Current candidates: "
+              Log() << Verbose(2) << "Current candidates: "
                   << A->second->node->Name << ","
                   << baseline->second.first->second->node->Name << ","
@@ -850 +851 @@
       if (checker == PointsOnBoundary.end())
         {
-          *out << "Looks like we have a candidate!" << endl;
+          Log() << Verbose(0) << "Looks like we have a candidate!" << endl;
           break;
         }
@@ -876 +877 @@
         }
 
-      *out << Verbose(1) << "Starting triangle is " << *BTS << "." << endl;
+      Log() << Verbose(1) << "Starting triangle is " << *BTS << "." << endl;
     }
   else
     {
-      *out << Verbose(1) << "No starting triangle found." << endl;
+      Log() << Verbose(1) << "No starting triangle found." << endl;
       exit(255);
     }
@@ -899 +900 @@
  * \param *cloud cluster of points
  */
-void Tesselation::TesselateOnBoundary(ofstream *out, const PointCloud * const cloud)
+void Tesselation::TesselateOnBoundary(const PointCloud * const cloud)
 {
   bool flag;
@@ -908 +909 @@
   LineMap::iterator LineChecker[2];
 
-  Center = cloud->GetCenter(out);
+  Center = cloud->GetCenter();
   // create a first tesselation with the given BoundaryPoints
   do {
@@ -919 +920 @@
         // get peak point with respect to this base line's only triangle
         BTS = baseline->second->triangles.begin()->second; // there is only one triangle so far
-        *out << Verbose(2) << "Current baseline is between " << *(baseline->second) << "." << endl;
+        Log() << Verbose(2) << "Current baseline is between " << *(baseline->second) << "." << endl;
         for (int i = 0; i < 3; i++)
           if ((BTS->endpoints[i] != baseline->second->endpoints[0]) && (BTS->endpoints[i] != baseline->second->endpoints[1]))
             peak = BTS->endpoints[i];
-        *out << Verbose(3) << " and has peak " << *peak << "." << endl;
+        Log() << Verbose(3) << " and has peak " << *peak << "." << endl;
 
         // prepare some auxiliary vectors
@@ -938 +939 @@
           CenterVector.AddVector(BTS->endpoints[i]->node->node);
         CenterVector.Scale(1. / 3.);
-        *out << Verbose(4) << "CenterVector of base triangle is " << CenterVector << endl;
+        Log() << Verbose(4) << "CenterVector of base triangle is " << CenterVector << endl;
 
         // normal vector of triangle
@@ -945 +946 @@
         BTS->GetNormalVector(NormalVector);
         NormalVector.CopyVector(&BTS->NormalVector);
-        *out << Verbose(4) << "NormalVector of base triangle is " << NormalVector << endl;
+        Log() << Verbose(4) << "NormalVector of base triangle is " << NormalVector << endl;
 
         // vector in propagation direction (out of triangle)
@@ -952 +953 @@
         TempVector.CopyVector(&CenterVector);
         TempVector.SubtractVector(baseline->second->endpoints[0]->node->node); // TempVector is vector on triangle plane pointing from one baseline egde towards center!
-        //*out << Verbose(2) << "Projection of propagation onto temp: " << PropagationVector.Projection(&TempVector) << "." << endl;
+        //Log() << Verbose(2) << "Projection of propagation onto temp: " << PropagationVector.Projection(&TempVector) << "." << endl;
         if (PropagationVector.ScalarProduct(&TempVector) > 0) // make sure normal propagation vector points outward from baseline
           PropagationVector.Scale(-1.);
-        *out << Verbose(4) << "PropagationVector of base triangle is " << PropagationVector << endl;
+        Log() << Verbose(4) << "PropagationVector of base triangle is " << PropagationVector << endl;
         winner = PointsOnBoundary.end();
 
@@ -961 +962 @@
         for (PointMap::iterator target = PointsOnBoundary.begin(); target != PointsOnBoundary.end(); target++) {
           if ((target->second != baseline->second->endpoints[0]) && (target->second != baseline->second->endpoints[1])) { // don't take the same endpoints
-            *out << Verbose(3) << "Target point is " << *(target->second) << ":" << endl;
+            Log() << Verbose(3) << "Target point is " << *(target->second) << ":" << endl;
 
             // first check direction, so that triangles don't intersect
@@ -968 +969 @@
             VirtualNormalVector.ProjectOntoPlane(&NormalVector);
             TempAngle = VirtualNormalVector.Angle(&PropagationVector);
-            *out << Verbose(4) << "VirtualNormalVector is " << VirtualNormalVector << " and PropagationVector is " << PropagationVector << "." << endl;
+            Log() << Verbose(4) << "VirtualNormalVector is " << VirtualNormalVector << " and PropagationVector is " << PropagationVector << "." << endl;
             if (TempAngle > (M_PI/2.)) { // no bends bigger than Pi/2 (90 degrees)
-              *out << Verbose(4) << "Angle on triangle plane between propagation direction and base line to " << *(target->second) << " is " << TempAngle << ", bad direction!" << endl;
+              Log() << Verbose(4) << "Angle on triangle plane between propagation direction and base line to " << *(target->second) << " is " << TempAngle << ", bad direction!" << endl;
               continue;
             } else
-              *out << Verbose(4) << "Angle on triangle plane between propagation direction and base line to " << *(target->second) << " is " << TempAngle << ", good direction!" << endl;
+              Log() << Verbose(4) << "Angle on triangle plane between propagation direction and base line to " << *(target->second) << " is " << TempAngle << ", good direction!" << endl;
 
             // check first and second endpoint (if any connecting line goes to target has at least not more than 1 triangle)
@@ -979 +980 @@
             LineChecker[1] = baseline->second->endpoints[1]->lines.find(target->first);
             if (((LineChecker[0] != baseline->second->endpoints[0]->lines.end()) && (LineChecker[0]->second->triangles.size() == 2))) {
-              *out << Verbose(4) << *(baseline->second->endpoints[0]) << " has line " << *(LineChecker[0]->second) << " to " << *(target->second) << " as endpoint with " << LineChecker[0]->second->triangles.size() << " triangles." << endl;
+              Log() << Verbose(4) << *(baseline->second->endpoints[0]) << " has line " << *(LineChecker[0]->second) << " to " << *(target->second) << " as endpoint with " << LineChecker[0]->second->triangles.size() << " triangles." << endl;
               continue;
             }
             if (((LineChecker[1] != baseline->second->endpoints[1]->lines.end()) && (LineChecker[1]->second->triangles.size() == 2))) {
-              *out << Verbose(4) << *(baseline->second->endpoints[1]) << " has line " << *(LineChecker[1]->second) << " to " << *(target->second) << " as endpoint with " << LineChecker[1]->second->triangles.size() << " triangles." << endl;
+              Log() << Verbose(4) << *(baseline->second->endpoints[1]) << " has line " << *(LineChecker[1]->second) << " to " << *(target->second) << " as endpoint with " << LineChecker[1]->second->triangles.size() << " triangles." << endl;
               continue;
             }
@@ -989 +990 @@
             // check whether the envisaged triangle does not already exist (if both lines exist and have same endpoint)
             if ((((LineChecker[0] != baseline->second->endpoints[0]->lines.end()) && (LineChecker[1] != baseline->second->endpoints[1]->lines.end()) && (GetCommonEndpoint(LineChecker[0]->second, LineChecker[1]->second) == peak)))) {
-              *out << Verbose(4) << "Current target is peak!" << endl;
+              Log() << Verbose(4) << "Current target is peak!" << endl;
               continue;
             }
@@ -1000 +1001 @@
             helper.ProjectOntoPlane(&TempVector);
             if (fabs(helper.NormSquared()) < MYEPSILON) {
-              *out << Verbose(4) << "Chosen set of vectors is linear dependent." << endl;
+              Log() << Verbose(4) << "Chosen set of vectors is linear dependent." << endl;
               continue;
             }
@@ -1017 +1018 @@
             // calculate angle
             TempAngle = NormalVector.Angle(&VirtualNormalVector);
-            *out << Verbose(4) << "NormalVector is " << VirtualNormalVector << " and the angle is " << TempAngle << "." << endl;
+            Log() << Verbose(4) << "NormalVector is " << VirtualNormalVector << " and the angle is " << TempAngle << "." << endl;
             if ((SmallestAngle - TempAngle) > MYEPSILON) { // set to new possible winner
               SmallestAngle = TempAngle;
               winner = target;
-              *out << Verbose(4) << "New winner " << *winner->second->node << " due to smaller angle between normal vectors." << endl;
+              Log() << Verbose(4) << "New winner " << *winner->second->node << " due to smaller angle between normal vectors." << endl;
             } else if (fabs(SmallestAngle - TempAngle) < MYEPSILON) { // check the angle to propagation, both possible targets are in one plane! (their normals have same angle)
               // hence, check the angles to some normal direction from our base line but in this common plane of both targets...
@@ -1039 +1040 @@
                 SmallestAngle = TempAngle;
                 winner = target;
-                *out << Verbose(4) << "New winner " << *winner->second->node << " due to smaller angle " << TempAngle << " to propagation direction." << endl;
+                Log() << Verbose(4) << "New winner " << *winner->second->node << " due to smaller angle " << TempAngle << " to propagation direction." << endl;
               } else
-                *out << Verbose(4) << "Keeping old winner " << *winner->second->node << " due to smaller angle to propagation direction." << endl;
+                Log() << Verbose(4) << "Keeping old winner " << *winner->second->node << " due to smaller angle to propagation direction." << endl;
             } else
-              *out << Verbose(4) << "Keeping old winner " << *winner->second->node << " due to smaller angle between normal vectors." << endl;
+              Log() << Verbose(4) << "Keeping old winner " << *winner->second->node << " due to smaller angle between normal vectors." << endl;
           }
         } // end of loop over all boundary points
@@ -1049 +1050 @@
         // 5b. The point of the above whose triangle has the greatest angle with the triangle the current line belongs to (it only belongs to one, remember!): New triangle
         if (winner != PointsOnBoundary.end()) {
-          *out << Verbose(2) << "Winning target point is " << *(winner->second) << " with angle " << SmallestAngle << "." << endl;
+          Log() << Verbose(2) << "Winning target point is " << *(winner->second) << " with angle " << SmallestAngle << "." << endl;
           // create the lins of not yet present
           BLS[0] = baseline->second;
@@ -1079 +1080 @@
           TrianglesOnBoundaryCount++;
         } else {
-          *out << Verbose(1) << "I could not determine a winner for this baseline " << *(baseline->second) << "." << endl;
+          Log() << Verbose(1) << "I could not determine a winner for this baseline " << *(baseline->second) << "." << endl;
         }
 
         // 5d. If the set of lines is not yet empty, go to 5. and continue
       } else
-        *out << Verbose(2) << "Baseline candidate " << *(baseline->second) << " has a triangle count of " << baseline->second->triangles.size() << "." << endl;
+        Log() << Verbose(2) << "Baseline candidate " << *(baseline->second) << " has a triangle count of " << baseline->second->triangles.size() << "." << endl;
   } while (flag);
 
@@ -1097 +1098 @@
  * \return true - all straddling points insert, false - something went wrong
  */
-bool Tesselation::InsertStraddlingPoints(ofstream *out, const PointCloud *cloud, const LinkedCell *LC)
+bool Tesselation::InsertStraddlingPoints(const PointCloud *cloud, const LinkedCell *LC)
 {
   Vector Intersection, Normal;
   TesselPoint *Walker = NULL;
-  Vector *Center = cloud->GetCenter(out);
+  Vector *Center = cloud->GetCenter();
   list<BoundaryTriangleSet*> *triangles = NULL;
   bool AddFlag = false;
   LinkedCell *BoundaryPoints = NULL;
 
-  *out << Verbose(1) << "Begin of InsertStraddlingPoints" << endl;
+  Log() << Verbose(1) << "Begin of InsertStraddlingPoints" << endl;
 
   cloud->GoToFirst();
@@ -1117 +1118 @@
     }
     Walker = cloud->GetPoint();
-    *out << Verbose(2) << "Current point is " << *Walker << "." << endl;
+    Log() << Verbose(2) << "Current point is " << *Walker << "." << endl;
     // get the next triangle
-    triangles = FindClosestTrianglesToPoint(out, Walker->node, BoundaryPoints);
+    triangles = FindClosestTrianglesToPoint(Walker->node, BoundaryPoints);
     BTS = triangles->front();
     if ((triangles == NULL) || (BTS->ContainsBoundaryPoint(Walker))) {
-      *out << Verbose(2) << "No triangles found, probably a tesselation point itself." << endl;
+      Log() << Verbose(2) << "No triangles found, probably a tesselation point itself." << endl;
       cloud->GoToNext();
       continue;
     } else {
     }
-    *out << Verbose(2) << "Closest triangle is " << *BTS << "." << endl;
+    Log() << Verbose(2) << "Closest triangle is " << *BTS << "." << endl;
     // get the intersection point
-    if (BTS->GetIntersectionInsideTriangle(out, Center, Walker->node, &Intersection)) {
-      *out << Verbose(2) << "We have an intersection at " << Intersection << "." << endl;
+    if (BTS->GetIntersectionInsideTriangle(Center, Walker->node, &Intersection)) {
+      Log() << Verbose(2) << "We have an intersection at " << Intersection << "." << endl;
       // we have the intersection, check whether in- or outside of boundary
       if ((Center->DistanceSquared(Walker->node) - Center->DistanceSquared(&Intersection)) < -MYEPSILON) {
         // inside, next!
-        *out << Verbose(2) << *Walker << " is inside wrt triangle " << *BTS << "." << endl;
+        Log() << Verbose(2) << *Walker << " is inside wrt triangle " << *BTS << "." << endl;
       } else {
         // outside!
-        *out << Verbose(2) << *Walker << " is outside wrt triangle " << *BTS << "." << endl;
+        Log() << Verbose(2) << *Walker << " is outside wrt triangle " << *BTS << "." << endl;
         class BoundaryLineSet *OldLines[3], *NewLines[3];
         class BoundaryPointSet *OldPoints[3], *NewPoint;
@@ -1147 +1148 @@
         Normal.CopyVector(&BTS->NormalVector);
         // add Walker to boundary points
-        *out << Verbose(2) << "Adding " << *Walker << " to BoundaryPoints." << endl;
+        Log() << Verbose(2) << "Adding " << *Walker << " to BoundaryPoints." << endl;
         AddFlag = true;
         if (AddBoundaryPoint(Walker,0))
@@ -1154 +1155 @@
           continue;
         // remove triangle
-        *out << Verbose(2) << "Erasing triangle " << *BTS << "." << endl;
+        Log() << Verbose(2) << "Erasing triangle " << *BTS << "." << endl;
         TrianglesOnBoundary.erase(BTS->Nr);
         delete(BTS);
@@ -1162 +1163 @@
           BPS[1] = OldPoints[i];
           NewLines[i] = new class BoundaryLineSet(BPS, LinesOnBoundaryCount);
-          *out << Verbose(3) << "Creating new line " << *NewLines[i] << "." << endl;
+          Log() << Verbose(3) << "Creating new line " << *NewLines[i] << "." << endl;
           LinesOnBoundary.insert(LinePair(LinesOnBoundaryCount, NewLines[i])); // no need for check for unique insertion as BPS[0] is definitely a new one
           LinesOnBoundaryCount++;
@@ -1173 +1174 @@
             if (NewLines[j]->IsConnectedTo(BLS[0])) {
               if (n>2) {
-                *out << Verbose(1) << "ERROR: " << BLS[0] << " connects to all of the new lines?!" << endl;
+                Log() << Verbose(1) << "ERROR: " << BLS[0] << " connects to all of the new lines?!" << endl;
                 return false;
               } else
@@ -1184 +1185 @@
           BTS->GetNormalVector(Normal);
           Normal.Scale(-1.);
-          *out << Verbose(2) << "Created new triangle " << *BTS << "." << endl;
+          Log() << Verbose(2) << "Created new triangle " << *BTS << "." << endl;
           TrianglesOnBoundary.insert(TrianglePair(TrianglesOnBoundaryCount, BTS));
           TrianglesOnBoundaryCount++;
@@ -1190 +1191 @@
       }
     } else { // something is wrong with FindClosestTriangleToPoint!
-      *out << Verbose(1) << "ERROR: The closest triangle did not produce an intersection!" << endl;
+      Log() << Verbose(1) << "ERROR: The closest triangle did not produce an intersection!" << endl;
       return false;
     }
@@ -1198 +1199 @@
   // exit
   delete(Center);
-  *out << Verbose(1) << "End of InsertStraddlingPoints" << endl;
+  Log() << Verbose(1) << "End of InsertStraddlingPoints" << endl;
   return true;
 };
@@ -1237 +1238 @@
   } else {
     delete TPS[n];
-    cout << Verbose(4) << "Node " << *((InsertUnique.first)->second->node) << " is already present in PointsOnBoundary." << endl;
+    Log() << Verbose(4) << "Node " << *((InsertUnique.first)->second->node) << " is already present in PointsOnBoundary." << endl;
     TPS[n] = (InsertUnique.first)->second;
   }
@@ -1257 +1258 @@
     pair<LineMap::iterator,LineMap::iterator> FindPair;
     FindPair = a->lines.equal_range(b->node->nr);
-    cout << Verbose(5) << "INFO: There is at least one line between " << *a << " and " << *b << ": " << *(FindLine->second) << "." << endl;
+    Log() << Verbose(5) << "INFO: There is at least one line between " << *a << " and " << *b << ": " << *(FindLine->second) << "." << endl;
 
     for (FindLine = FindPair.first; FindLine != FindPair.second; FindLine++) {
@@ -1263 +1264 @@
       if (FindLine->second->triangles.size() < 2) {
         insertNewLine = false;
-        cout << Verbose(4) << "Using existing line " << *FindLine->second << endl;
+        Log() << Verbose(4) << "Using existing line " << *FindLine->second << endl;
 
         BPS[0] = FindLine->second->endpoints[0];
@@ -1290 +1291 @@
 void Tesselation::AlwaysAddTesselationTriangleLine(class BoundaryPointSet *a, class BoundaryPointSet *b, const int n)
 {
-  cout << Verbose(4) << "Adding line [" << LinesOnBoundaryCount << "|" << *(a->node) << " and " << *(b->node) << "." << endl;
+  Log() << Verbose(4) << "Adding line [" << LinesOnBoundaryCount << "|" << *(a->node) << " and " << *(b->node) << "." << endl;
   BPS[0] = a;
   BPS[1] = b;
@@ -1305 +1306 @@
 void Tesselation::AddTesselationTriangle()
 {
-  cout << Verbose(1) << "Adding triangle to global TrianglesOnBoundary map." << endl;
+  Log() << Verbose(1) << "Adding triangle to global TrianglesOnBoundary map." << endl;
 
   // add triangle to global map
@@ -1323 +1324 @@
 void Tesselation::AddTesselationTriangle(const int nr)
 {
-  cout << Verbose(1) << "Adding triangle to global TrianglesOnBoundary map." << endl;
+  Log() << Verbose(1) << "Adding triangle to global TrianglesOnBoundary map." << endl;
 
   // add triangle to global map
@@ -1345 +1346 @@
   for (int i = 0; i < 3; i++) {
     if (triangle->lines[i] != NULL) {
-      cout << Verbose(5) << "Removing triangle Nr." << triangle->Nr << " in line " << *triangle->lines[i] << "." << endl;
+      Log() << Verbose(5) << "Removing triangle Nr." << triangle->Nr << " in line " << *triangle->lines[i] << "." << endl;
       triangle->lines[i]->triangles.erase(triangle->Nr);
       if (triangle->lines[i]->triangles.empty()) {
-          cout << Verbose(5) << *triangle->lines[i] << " is no more attached to any triangle, erasing." << endl;
+          Log() << Verbose(5) << *triangle->lines[i] << " is no more attached to any triangle, erasing." << endl;
           RemoveTesselationLine(triangle->lines[i]);
       } else {
-        cout << Verbose(5) << *triangle->lines[i] << " is still attached to another triangle: ";
+        Log() << Verbose(5) << *triangle->lines[i] << " is still attached to another triangle: ";
         for(TriangleMap::iterator TriangleRunner = triangle->lines[i]->triangles.begin(); TriangleRunner != triangle->lines[i]->triangles.end(); TriangleRunner++)
-          cout << "[" << (TriangleRunner->second)->Nr << "|" << *((TriangleRunner->second)->endpoints[0]) << ", " << *((TriangleRunner->second)->endpoints[1]) << ", " << *((TriangleRunner->second)->endpoints[2]) << "] \t";
-        cout << endl;
+          Log() << Verbose(0) << "[" << (TriangleRunner->second)->Nr << "|" << *((TriangleRunner->second)->endpoints[0]) << ", " << *((TriangleRunner->second)->endpoints[1]) << ", " << *((TriangleRunner->second)->endpoints[2]) << "] \t";
+        Log() << Verbose(0) << endl;
 //        for (int j=0;j<2;j++) {
-//          cout << Verbose(5) << "Lines of endpoint " << *(triangle->lines[i]->endpoints[j]) << ": ";
+//          Log() << Verbose(5) << "Lines of endpoint " << *(triangle->lines[i]->endpoints[j]) << ": ";
 //          for(LineMap::iterator LineRunner = triangle->lines[i]->endpoints[j]->lines.begin(); LineRunner != triangle->lines[i]->endpoints[j]->lines.end(); LineRunner++)
-//            cout << "[" << *(LineRunner->second) << "] \t";
-//          cout << endl;
+//            Log() << Verbose(0) << "[" << *(LineRunner->second) << "] \t";
+//          Log() << Verbose(0) << endl;
 //        }
       }
       triangle->lines[i] = NULL;  // free'd or not: disconnect
     } else
-      cerr << "ERROR: This line " << i << " has already been free'd." << endl;
+      eLog() << Verbose(0) << "ERROR: This line " << i << " has already been free'd." << endl;
   }
 
   if (TrianglesOnBoundary.erase(triangle->Nr))
-    cout << Verbose(5) << "Removing triangle Nr. " << triangle->Nr << "." << endl;
+    Log() << Verbose(5) << "Removing triangle Nr. " << triangle->Nr << "." << endl;
   delete(triangle);
 };
@@ -1398 +1399 @@
         for (LineMap::iterator Runner = erasor.first; Runner != erasor.second; Runner++)
           if ((*Runner).second == line) {
-            cout << Verbose(5) << "Removing Line Nr. " << line->Nr << " in boundary point " << *line->endpoints[i] << "." << endl;
+            Log() << Verbose(5) << "Removing Line Nr. " << line->Nr << " in boundary point " << *line->endpoints[i] << "." << endl;
             line->endpoints[i]->lines.erase(Runner);
             break;
@@ -1404 +1405 @@
       } else { // there's just a single line left
         if (line->endpoints[i]->lines.erase(line->Nr))
-          cout << Verbose(5) << "Removing Line Nr. " << line->Nr << " in boundary point " << *line->endpoints[i] << "." << endl;
+          Log() << Verbose(5) << "Removing Line Nr. " << line->Nr << " in boundary point " << *line->endpoints[i] << "." << endl;
       }
       if (line->endpoints[i]->lines.empty()) {
-        cout << Verbose(5) << *line->endpoints[i] << " has no more lines it's attached to, erasing." << endl;
+        Log() << Verbose(5) << *line->endpoints[i] << " has no more lines it's attached to, erasing." << endl;
         RemoveTesselationPoint(line->endpoints[i]);
       } else {
-        cout << Verbose(5) << *line->endpoints[i] << " has still lines it's attached to: ";
+        Log() << Verbose(5) << *line->endpoints[i] << " has still lines it's attached to: ";
         for(LineMap::iterator LineRunner = line->endpoints[i]->lines.begin(); LineRunner != line->endpoints[i]->lines.end(); LineRunner++)
-          cout << "[" << *(LineRunner->second) << "] \t";
-        cout << endl;
+          Log() << Verbose(0) << "[" << *(LineRunner->second) << "] \t";
+        Log() << Verbose(0) << endl;
       }
       line->endpoints[i] = NULL;  // free'd or not: disconnect
     } else
-      cerr << "ERROR: Endpoint " << i << " has already been free'd." << endl;
+      eLog() << Verbose(0) << "ERROR: Endpoint " << i << " has already been free'd." << endl;
   }
   if (!line->triangles.empty())
-    cerr << "WARNING: Memory Leak! I " << *line << " am still connected to some triangles." << endl;
+    eLog() << Verbose(0) << "WARNING: Memory Leak! I " << *line << " am still connected to some triangles." << endl;
 
   if (LinesOnBoundary.erase(line->Nr))
-    cout << Verbose(5) << "Removing line Nr. " << line->Nr << "." << endl;
+    Log() << Verbose(5) << "Removing line Nr. " << line->Nr << "." << endl;
   delete(line);
 };
@@ -1437 +1438 @@
     return;
   if (PointsOnBoundary.erase(point->Nr))
-    cout << Verbose(5) << "Removing point Nr. " << point->Nr << "." << endl;
+    Log() << Verbose(5) << "Removing point Nr. " << point->Nr << "." << endl;
   delete(point);
 };
@@ -1450 +1451 @@
  *                 triangles exist which is the maximum for three points
  */
-int Tesselation::CheckPresenceOfTriangle(ofstream *out, TesselPoint *Candidates[3]) {
+int Tesselation::CheckPresenceOfTriangle(TesselPoint *Candidates[3]) {
   int adjacentTriangleCount = 0;
   class BoundaryPointSet *Points[3];
 
-  *out << Verbose(2) << "Begin of CheckPresenceOfTriangle" << endl;
+  Log() << Verbose(2) << "Begin of CheckPresenceOfTriangle" << endl;
   // builds a triangle point set (Points) of the end points
   for (int i = 0; i < 3; i++) {
@@ -1473 +1474 @@
           for (; (FindLine != Points[i]->lines.end()) && (FindLine->first == Points[j]->node->nr); FindLine++) {
             TriangleMap *triangles = &FindLine->second->triangles;
-            *out << Verbose(3) << "Current line is " << FindLine->first << ": " << *(FindLine->second) << " with triangles " << triangles << "." << endl;
+            Log() << Verbose(3) << "Current line is " << FindLine->first << ": " << *(FindLine->second) << " with triangles " << triangles << "." << endl;
             for (TriangleMap::iterator FindTriangle = triangles->begin(); FindTriangle != triangles->end(); FindTriangle++) {
               if (FindTriangle->second->IsPresentTupel(Points)) {
@@ -1479 +1480 @@
               }
             }
-            *out << Verbose(3) << "end." << endl;
+            Log() << Verbose(3) << "end." << endl;
           }
           // Only one of the triangle lines must be considered for the triangle count.
-          //*out << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
+          //Log() << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
           //return adjacentTriangleCount;
         }
@@ -1489 +1490 @@
   }
 
-  *out << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
-  *out << Verbose(2) << "End of CheckPresenceOfTriangle" << endl;
+  Log() << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
+  Log() << Verbose(2) << "End of CheckPresenceOfTriangle" << endl;
   return adjacentTriangleCount;
 };
@@ -1502 +1503 @@
  * \return NULL - none found or pointer to triangle
  */
-class BoundaryTriangleSet * Tesselation::GetPresentTriangle(ofstream *out, TesselPoint *Candidates[3])
+class BoundaryTriangleSet * Tesselation::GetPresentTriangle(TesselPoint *Candidates[3])
 {
   class BoundaryTriangleSet *triangle = NULL;
@@ -1533 +1534 @@
           }
           // Only one of the triangle lines must be considered for the triangle count.
-          //*out << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
+          //Log() << Verbose(2) << "Found " << adjacentTriangleCount << " adjacent triangles for the point set." << endl;
           //return adjacentTriangleCount;
         }
@@ -1552 +1553 @@
  * \param *LC LinkedCell structure with neighbouring TesselPoint's
  */
-void Tesselation::FindStartingTriangle(ofstream *out, const double RADIUS, const LinkedCell *LC)
-{
-  cout << Verbose(1) << "Begin of FindStartingTriangle\n";
+void Tesselation::FindStartingTriangle(const double RADIUS, const LinkedCell *LC)
+{
+  Log() << Verbose(1) << "Begin of FindStartingTriangle\n";
   int i = 0;
   TesselPoint* FirstPoint = NULL;
@@ -1578 +1579 @@
       for (LC->n[(i+2)%NDIM]=0;LC->n[(i+2)%NDIM]<LC->N[(i+2)%NDIM];LC->n[(i+2)%NDIM]++) {
         const LinkedNodes *List = LC->GetCurrentCell();
-        //cout << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
+        //Log() << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
         if (List != NULL) {
           for (LinkedNodes::const_iterator Runner = List->begin();Runner != List->end();Runner++) {
             if ((*Runner)->node->x[i] > maxCoordinate[i]) {
-              cout << Verbose(2) << "New maximal for axis " << i << " node is " << *(*Runner) << " at " << *(*Runner)->node << "." << endl;
+              Log() << Verbose(2) << "New maximal for axis " << i << " node is " << *(*Runner) << " at " << *(*Runner)->node << "." << endl;
               maxCoordinate[i] = (*Runner)->node->x[i];
               MaxPoint[i] = (*Runner);
@@ -1588 +1589 @@
           }
         } else {
-          cerr << "ERROR: The current cell " << LC->n[0] << "," << LC->n[1] << "," << LC->n[2] << " is invalid!" << endl;
+          eLog() << Verbose(0) << "ERROR: The current cell " << LC->n[0] << "," << LC->n[1] << "," << LC->n[2] << " is invalid!" << endl;
         }
       }
   }
 
-  cout << Verbose(2) << "Found maximum coordinates: ";
+  Log() << Verbose(2) << "Found maximum coordinates: ";
   for (int i=0;i<NDIM;i++)
-    cout << i << ": " << *MaxPoint[i] << "\t";
-  cout << endl;
+    Log() << Verbose(0) << i << ": " << *MaxPoint[i] << "\t";
+  Log() << Verbose(0) << endl;
 
   BTS = NULL;
@@ -1604 +1605 @@
     Oben.x[k] = 1.;
     FirstPoint = MaxPoint[k];
-    cout << Verbose(1) << "Coordinates of start node at " << *FirstPoint->node << "." << endl;
+    Log() << Verbose(1) << "Coordinates of start node at " << *FirstPoint->node << "." << endl;
 
     double ShortestAngle;
@@ -1635 +1636 @@
 
     // adding point 1 and point 2 and add the line between them
-    cout << Verbose(1) << "Coordinates of start node at " << *FirstPoint->node << "." << endl;
+    Log() << Verbose(1) << "Coordinates of start node at " << *FirstPoint->node << "." << endl;
     AddTesselationPoint(FirstPoint, 0);
-    cout << Verbose(1) << "Found second point is at " << *SecondPoint->node << ".\n";
+    Log() << Verbose(1) << "Found second point is at " << *SecondPoint->node << ".\n";
     AddTesselationPoint(SecondPoint, 1);
     AddTesselationLine(TPS[0], TPS[1], 0);
 
-    //cout << Verbose(2) << "INFO: OldSphereCenter is at " << helper << ".\n";
+    //Log() << Verbose(2) << "INFO: OldSphereCenter is at " << helper << ".\n";
     FindThirdPointForTesselation(Oben, SearchDirection, helper, BLS[0], NULL, *&OptCandidates, &ShortestAngle, RADIUS, LC);
-    cout << Verbose(1) << "List of third Points is ";
+    Log() << Verbose(1) << "List of third Points is ";
     for (CandidateList::iterator it = OptCandidates->begin(); it != OptCandidates->end(); ++it) {
-        cout << " " << *(*it)->point;
-    }
-    cout << endl;
+        Log() << Verbose(0) << " " << *(*it)->point;
+    }
+    Log() << Verbose(0) << endl;
 
     for (CandidateList::iterator it = OptCandidates->begin(); it != OptCandidates->end(); ++it) {
@@ -1660 +1661 @@
       // ... and calculate its normal vector (with correct orientation)
       (*it)->OptCenter.Scale(-1.);
-      cout << Verbose(2) << "Anti-Oben is currently " << (*it)->OptCenter << "." << endl;
+      Log() << Verbose(2) << "Anti-Oben is currently " << (*it)->OptCenter << "." << endl;
       BTS->GetNormalVector((*it)->OptCenter);  // vector to compare with should point inwards
-      cout << Verbose(0) << "==> Found starting triangle consists of " << *FirstPoint << ", " << *SecondPoint << " and "
+      Log() << Verbose(0) << "==> Found starting triangle consists of " << *FirstPoint << ", " << *SecondPoint << " and "
       << *(*it)->point << " with normal vector " << BTS->NormalVector << ".\n";
 
@@ -1674 +1675 @@
         AddTesselationLine(TPS[0], TPS[1], 0);
       }
-      cout << Verbose(2) << "Projection is " << BTS->NormalVector.ScalarProduct(&Oben) << "." << endl;
+      Log() << Verbose(2) << "Projection is " << BTS->NormalVector.ScalarProduct(&Oben) << "." << endl;
     }
     if (BTS != NULL) // we have created one starting triangle
@@ -1696 +1697 @@
   }
   delete(OptCandidates);
-  cout << Verbose(1) << "End of FindStartingTriangle\n";
+  Log() << Verbose(1) << "End of FindStartingTriangle\n";
 };
 
@@ -1708 +1709 @@
  * @param *LC LinkedCell structure with neighbouring points
  */
-bool Tesselation::FindNextSuitableTriangle(ofstream *out, BoundaryLineSet &Line, BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell *LC)
-{
-  cout << Verbose(0) << "Begin of FindNextSuitableTriangle\n";
+bool Tesselation::FindNextSuitableTriangle(BoundaryLineSet &Line, BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell *LC)
+{
+  Log() << Verbose(0) << "Begin of FindNextSuitableTriangle\n";
   bool result = true;
   CandidateList *OptCandidates = new CandidateList();
@@ -1724 +1725 @@
   double radius, CircleRadius;
 
-  cout << Verbose(1) << "Current baseline is " << Line << " of triangle " << T << "." << endl;
+  Log() << Verbose(1) << "Current baseline is " << Line << " of triangle " << T << "." << endl;
   for (int i=0;i<3;i++)
     if ((T.endpoints[i]->node != Line.endpoints[0]->node) && (T.endpoints[i]->node != Line.endpoints[1]->node))
@@ -1743 +1744 @@
     CircleRadius = RADIUS*RADIUS - radius/4.;
     CirclePlaneNormal.Normalize();
-    //cout << Verbose(2) << "INFO: CircleCenter is at " << CircleCenter << ", CirclePlaneNormal is " << CirclePlaneNormal << " with circle radius " << sqrt(CircleRadius) << "." << endl;
+    //Log() << Verbose(2) << "INFO: CircleCenter is at " << CircleCenter << ", CirclePlaneNormal is " << CirclePlaneNormal << " with circle radius " << sqrt(CircleRadius) << "." << endl;
 
     // construct old center
@@ -1752 +1753 @@
     OldSphereCenter.AddVector(&helper);
     OldSphereCenter.SubtractVector(&CircleCenter);
-    //cout << Verbose(2) << "INFO: OldSphereCenter is at " << OldSphereCenter << "." << endl;
+    //Log() << Verbose(2) << "INFO: OldSphereCenter is at " << OldSphereCenter << "." << endl;
 
     // construct SearchDirection
@@ -1762 +1763 @@
     SearchDirection.ProjectOntoPlane(&OldSphereCenter);
     SearchDirection.Normalize();
-    cout << Verbose(2) << "INFO: SearchDirection is " << SearchDirection << "." << endl;
+    Log() << Verbose(2) << "INFO: SearchDirection is " << SearchDirection << "." << endl;
     if (fabs(OldSphereCenter.ScalarProduct(&SearchDirection)) > HULLEPSILON) {
       // rotated the wrong way!
-      cerr << "ERROR: SearchDirection and RelativeOldSphereCenter are still not orthogonal!" << endl;
+      eLog() << Verbose(0) << "ERROR: SearchDirection and RelativeOldSphereCenter are still not orthogonal!" << endl;
     }
 
@@ -1772 +1773 @@
 
   } else {
-    cout << Verbose(1) << "Circumcircle for base line " << Line << " and base triangle " << T << " is too big!" << endl;
+    Log() << Verbose(1) << "Circumcircle for base line " << Line << " and base triangle " << T << " is too big!" << endl;
   }
 
   if (OptCandidates->begin() == OptCandidates->end()) {
-    cerr << "WARNING: Could not find a suitable candidate." << endl;
+    eLog() << Verbose(0) << "WARNING: Could not find a suitable candidate." << endl;
     return false;
   }
-  cout << Verbose(1) << "Third Points are ";
+  Log() << Verbose(1) << "Third Points are ";
   for (CandidateList::iterator it = OptCandidates->begin(); it != OptCandidates->end(); ++it) {
-    cout << " " << *(*it)->point;
-  }
-  cout << endl;
+    Log() << Verbose(0) << " " << *(*it)->point;
+  }
+  Log() << Verbose(0) << endl;
 
   BoundaryLineSet *BaseRay = &Line;
   for (CandidateList::iterator it = OptCandidates->begin(); it != OptCandidates->end(); ++it) {
-    cout << Verbose(1) << " Third point candidate is " << *(*it)->point
+    Log() << Verbose(1) << " Third point candidate is " << *(*it)->point
     << " with circumsphere's center at " << (*it)->OptCenter << "." << endl;
-    cout << Verbose(1) << " Baseline is " << *BaseRay << endl;
+    Log() << Verbose(1) << " Baseline is " << *BaseRay << endl;
 
     // check whether all edges of the new triangle still have space for one more triangle (i.e. TriangleCount <2)
@@ -1796 +1797 @@
     PointCandidates[1] = BaseRay->endpoints[0]->node;
     PointCandidates[2] = BaseRay->endpoints[1]->node;
-    int existentTrianglesCount = CheckPresenceOfTriangle(out, PointCandidates);
+    int existentTrianglesCount = CheckPresenceOfTriangle(PointCandidates);
 
     BTS = NULL;
@@ -1816 +1817 @@
         (*it)->OptCenter.Scale(-1.);
 
-        cout << "--> New triangle with " << *BTS << " and normal vector " << BTS->NormalVector
+        Log() << Verbose(0) << "--> New triangle with " << *BTS << " and normal vector " << BTS->NormalVector
           << " for this triangle ... " << endl;
-      //cout << Verbose(1) << "We have "<< TrianglesOnBoundaryCount << " for line " << *BaseRay << "." << endl;
+      //Log() << Verbose(1) << "We have "<< TrianglesOnBoundaryCount << " for line " << *BaseRay << "." << endl;
       } else {
-        cout << Verbose(1) << "WARNING: This triangle consisting of ";
-        cout << *(*it)->point << ", ";
-        cout << *BaseRay->endpoints[0]->node << " and ";
-        cout << *BaseRay->endpoints[1]->node << " ";
-        cout << "exists and is not added, as it does not seem helpful!" << endl;
+        Log() << Verbose(1) << "WARNING: This triangle consisting of ";
+        Log() << Verbose(0) << *(*it)->point << ", ";
+        Log() << Verbose(0) << *BaseRay->endpoints[0]->node << " and ";
+        Log() << Verbose(0) << *BaseRay->endpoints[1]->node << " ";
+        Log() << Verbose(0) << "exists and is not added, as it does not seem helpful!" << endl;
         result = false;
       }
@@ -1846 +1847 @@
           (*it)->OtherOptCenter.Scale(-1.);
 
-          cout << "--> WARNING: Special new triangle with " << *BTS << " and normal vector " << BTS->NormalVector
+          Log() << Verbose(0) << "--> WARNING: Special new triangle with " << *BTS << " and normal vector " << BTS->NormalVector
           << " for this triangle ... " << endl;
-          cout << Verbose(1) << "We have "<< BaseRay->triangles.size() << " for line " << BaseRay << "." << endl;
+          Log() << Verbose(1) << "We have "<< BaseRay->triangles.size() << " for line " << BaseRay << "." << endl;
         } else {
-          cout << Verbose(1) << "WARNING: This triangle consisting of ";
-          cout << *(*it)->point << ", ";
-          cout << *BaseRay->endpoints[0]->node << " and ";
-          cout << *BaseRay->endpoints[1]->node << " ";
-          cout << "exists and is not added, as it does not seem helpful!" << endl;
+          Log() << Verbose(1) << "WARNING: This triangle consisting of ";
+          Log() << Verbose(0) << *(*it)->point << ", ";
+          Log() << Verbose(0) << *BaseRay->endpoints[0]->node << " and ";
+          Log() << Verbose(0) << *BaseRay->endpoints[1]->node << " ";
+          Log() << Verbose(0) << "exists and is not added, as it does not seem helpful!" << endl;
           result = false;
         }
     } else {
-      cout << Verbose(1) << "This triangle consisting of ";
-      cout << *(*it)->point << ", ";
-      cout << *BaseRay->endpoints[0]->node << " and ";
-      cout << *BaseRay->endpoints[1]->node << " ";
-      cout << "is invalid!" << endl;
+      Log() << Verbose(1) << "This triangle consisting of ";
+      Log() << Verbose(0) << *(*it)->point << ", ";
+      Log() << Verbose(0) << *BaseRay->endpoints[0]->node << " and ";
+      Log() << Verbose(0) << *BaseRay->endpoints[1]->node << " ";
+      Log() << Verbose(0) << "is invalid!" << endl;
       result = false;
     }
@@ -1869 +1870 @@
     BaseRay = BLS[0];
     if ((BTS != NULL) && (BTS->NormalVector.NormSquared() < MYEPSILON)) {
-      *out << Verbose(1) << "CRITICAL: Triangle " << *BTS << " has zero normal vector!" << endl;
+      Log() << Verbose(1) << "CRITICAL: Triangle " << *BTS << " has zero normal vector!" << endl;
       exit(255);
     }
@@ -1882 +1883 @@
   }
   delete(OptCandidates);
-  cout << Verbose(0) << "End of FindNextSuitableTriangle\n";
+  Log() << Verbose(0) << "End of FindNextSuitableTriangle\n";
   return result;
 };
@@ -1893 +1894 @@
  * \return NULL - convex, otherwise endpoint that makes it concave
  */
-class BoundaryPointSet *Tesselation::IsConvexRectangle(ofstream *out, class BoundaryLineSet *Base)
+class BoundaryPointSet *Tesselation::IsConvexRectangle(class BoundaryLineSet *Base)
 {
   class BoundaryPointSet *Spot = NULL;
@@ -1906 +1907 @@
   OtherBase = new class BoundaryLineSet(BPS,-1);
 
-  *out << Verbose(3) << "INFO: Current base line is " << *Base << "." << endl;
-  *out << Verbose(3) << "INFO: Other base line is " << *OtherBase << "." << endl;
+  Log() << Verbose(3) << "INFO: Current base line is " << *Base << "." << endl;
+  Log() << Verbose(3) << "INFO: Other base line is " << *OtherBase << "." << endl;
 
   // get the closest point on each line to the other line
-  ClosestPoint = GetClosestPointBetweenLine(out, Base, OtherBase);
+  ClosestPoint = GetClosestPointBetweenLine(Base, OtherBase);
 
   // delete the temporary other base line
@@ -1927 +1928 @@
   delete(ClosestPoint);
   if ((distance[0] * distance[1]) > 0)  { // have same sign?
-    *out << Verbose(3) << "REJECT: Both SKPs have same sign: " << distance[0] << " and " << distance[1]  << ". " << *Base << "' rectangle is concave." << endl;
+    Log() << Verbose(3) << "REJECT: Both SKPs have same sign: " << distance[0] << " and " << distance[1]  << ". " << *Base << "' rectangle is concave." << endl;
     if (distance[0] < distance[1]) {
       Spot = Base->endpoints[0];
@@ -1935 +1936 @@
     return Spot;
   } else {  // different sign, i.e. we are in between
-    *out << Verbose(3) << "ACCEPT: Rectangle of triangles of base line " << *Base << " is convex." << endl;
+    Log() << Verbose(3) << "ACCEPT: Rectangle of triangles of base line " << *Base << " is convex." << endl;
     return NULL;
   }
@@ -1944 +1945 @@
 {
   // print all lines
-  *out << Verbose(1) << "Printing all boundary points for debugging:" << endl;
+  Log() << Verbose(1) << "Printing all boundary points for debugging:" << endl;
   for (PointMap::const_iterator PointRunner = PointsOnBoundary.begin();PointRunner != PointsOnBoundary.end(); PointRunner++)
-    *out << Verbose(2) << *(PointRunner->second) << endl;
+    Log() << Verbose(2) << *(PointRunner->second) << endl;
 };
 
@@ -1952 +1953 @@
 {
   // print all lines
-  *out << Verbose(1) << "Printing all boundary lines for debugging:" << endl;
+  Log() << Verbose(1) << "Printing all boundary lines for debugging:" << endl;
   for (LineMap::const_iterator LineRunner = LinesOnBoundary.begin(); LineRunner != LinesOnBoundary.end(); LineRunner++)
-    *out << Verbose(2) << *(LineRunner->second) << endl;
+    Log() << Verbose(2) << *(LineRunner->second) << endl;
 };
 
@@ -1960 +1961 @@
 {
   // print all triangles
-  *out << Verbose(1) << "Printing all boundary triangles for debugging:" << endl;
+  Log() << Verbose(1) << "Printing all boundary triangles for debugging:" << endl;
   for (TriangleMap::const_iterator TriangleRunner = TrianglesOnBoundary.begin(); TriangleRunner != TrianglesOnBoundary.end(); TriangleRunner++)
-    *out << Verbose(2) << *(TriangleRunner->second) << endl;
+    Log() << Verbose(2) << *(TriangleRunner->second) << endl;
 };
 
@@ -1970 +1971 @@
  * \return volume change due to flipping (0 - then no flipped occured)
  */
-double Tesselation::PickFarthestofTwoBaselines(ofstream *out, class BoundaryLineSet *Base)
+double Tesselation::PickFarthestofTwoBaselines(class BoundaryLineSet *Base)
 {
   class BoundaryLineSet *OtherBase;
@@ -1983 +1984 @@
   OtherBase = new class BoundaryLineSet(BPS,-1);
 
-  *out << Verbose(3) << "INFO: Current base line is " << *Base << "." << endl;
-  *out << Verbose(3) << "INFO: Other base line is " << *OtherBase << "." << endl;
+  Log() << Verbose(3) << "INFO: Current base line is " << *Base << "." << endl;
+  Log() << Verbose(3) << "INFO: Other base line is " << *OtherBase << "." << endl;
 
   // get the closest point on each line to the other line
-  ClosestPoint[0] = GetClosestPointBetweenLine(out, Base, OtherBase);
-  ClosestPoint[1] = GetClosestPointBetweenLine(out, OtherBase, Base);
+  ClosestPoint[0] = GetClosestPointBetweenLine(Base, OtherBase);
+  ClosestPoint[1] = GetClosestPointBetweenLine(OtherBase, Base);
 
   // get the distance vector from Base line to OtherBase line
@@ -2004 +2005 @@
 
   if (Distance.NormSquared() < MYEPSILON) { // check for intersection
-    *out << Verbose(3) << "REJECT: Both lines have an intersection: Nothing to do." << endl;
+    Log() << Verbose(3) << "REJECT: Both lines have an intersection: Nothing to do." << endl;
     return false;
   } else { // check for sign against BaseLineNormal
@@ -2010 +2011 @@
     BaseLineNormal.Zero();
     if (Base->triangles.size() < 2) {
-      *out << Verbose(2) << "ERROR: Less than two triangles are attached to this baseline!" << endl;
+      Log() << Verbose(2) << "ERROR: Less than two triangles are attached to this baseline!" << endl;
       return 0.;
     }
     for (TriangleMap::iterator runner = Base->triangles.begin(); runner != Base->triangles.end(); runner++) {
-      *out << Verbose(4) << "INFO: Adding NormalVector " << runner->second->NormalVector << " of triangle " << *(runner->second) << "." << endl;
+      Log() << Verbose(4) << "INFO: Adding NormalVector " << runner->second->NormalVector << " of triangle " << *(runner->second) << "." << endl;
       BaseLineNormal.AddVector(&(runner->second->NormalVector));
     }
@@ -2020 +2021 @@
 
     if (Distance.ScalarProduct(&BaseLineNormal) > MYEPSILON) { // Distance points outwards, hence OtherBase higher than Base -> flip
-      *out << Verbose(2) << "ACCEPT: Other base line would be higher: Flipping baseline." << endl;
+      Log() << Verbose(2) << "ACCEPT: Other base line would be higher: Flipping baseline." << endl;
       // calculate volume summand as a general tetraeder
       return volume;
     } else {  // Base higher than OtherBase -> do nothing
-      *out << Verbose(2) << "REJECT: Base line is higher: Nothing to do." << endl;
+      Log() << Verbose(2) << "REJECT: Base line is higher: Nothing to do." << endl;
       return 0.;
     }
@@ -2037 +2038 @@
  * \return pointer to allocated new baseline - flipping successful, NULL - something went awry
  */
-class BoundaryLineSet * Tesselation::FlipBaseline(ofstream *out, class BoundaryLineSet *Base)
+class BoundaryLineSet * Tesselation::FlipBaseline(class BoundaryLineSet *Base)
 {
   class BoundaryLineSet *OldLines[4], *NewLine;
@@ -2045 +2046 @@
   int i,m;
 
-  *out << Verbose(1) << "Begin of FlipBaseline" << endl;
+  Log() << Verbose(1) << "Begin of FlipBaseline" << endl;
 
   // calculate NormalVector for later use
   BaseLineNormal.Zero();
   if (Base->triangles.size() < 2) {
-    *out << Verbose(2) << "ERROR: Less than two triangles are attached to this baseline!" << endl;
+    Log() << Verbose(2) << "ERROR: Less than two triangles are attached to this baseline!" << endl;
     return NULL;
   }
   for (TriangleMap::iterator runner = Base->triangles.begin(); runner != Base->triangles.end(); runner++) {
-    *out << Verbose(4) << "INFO: Adding NormalVector " << runner->second->NormalVector << " of triangle " << *(runner->second) << "." << endl;
+    Log() << Verbose(4) << "INFO: Adding NormalVector " << runner->second->NormalVector << " of triangle " << *(runner->second) << "." << endl;
     BaseLineNormal.AddVector(&(runner->second->NormalVector));
   }
@@ -2067 +2068 @@
   i=0;
   m=0;
-  *out << Verbose(3) << "The four old lines are: ";
+  Log() << Verbose(3) << "The four old lines are: ";
   for(TriangleMap::iterator runner = Base->triangles.begin(); runner != Base->triangles.end(); runner++)
     for (int j=0;j<3;j++) // all of their endpoints and baselines
       if (runner->second->lines[j] != Base) { // pick not the central baseline
         OldLines[i++] = runner->second->lines[j];
-        *out << *runner->second->lines[j] << "\t";
+        Log() << Verbose(0) << *runner->second->lines[j] << "\t";
       }
-  *out << endl;
-  *out << Verbose(3) << "The two old points are: ";
+  Log() << Verbose(0) << endl;
+  Log() << Verbose(3) << "The two old points are: ";
   for(TriangleMap::iterator runner = Base->triangles.begin(); runner != Base->triangles.end(); runner++)
     for (int j=0;j<3;j++) // all of their endpoints and baselines
       if (!Base->ContainsBoundaryPoint(runner->second->endpoints[j])) { // and neither of its endpoints
         OldPoints[m++] = runner->second->endpoints[j];
-        *out << *runner->second->endpoints[j] << "\t";
+        Log() << Verbose(0) << *runner->second->endpoints[j] << "\t";
       }
-  *out << endl;
+  Log() << Verbose(0) << endl;
 
   // check whether everything is in place to create new lines and triangles
   if (i<4) {
-    *out << Verbose(1) << "ERROR: We have not gathered enough baselines!" << endl;
+    Log() << Verbose(1) << "ERROR: We have not gathered enough baselines!" << endl;
     return NULL;
   }
   for (int j=0;j<4;j++)
     if (OldLines[j] == NULL) {
-      *out << Verbose(1) << "ERROR: We have not gathered enough baselines!" << endl;
+      Log() << Verbose(1) << "ERROR: We have not gathered enough baselines!" << endl;
       return NULL;
     }
   for (int j=0;j<2;j++)
     if (OldPoints[j] == NULL) {
-      *out << Verbose(1) << "ERROR: We have not gathered enough endpoints!" << endl;
+      Log() << Verbose(1) << "ERROR: We have not gathered enough endpoints!" << endl;
       return NULL;
     }
 
   // remove triangles and baseline removes itself
-  *out << Verbose(3) << "INFO: Deleting baseline " << *Base << " from global list." << endl;
+  Log() << Verbose(3) << "INFO: Deleting baseline " << *Base << " from global list." << endl;
   OldBaseLineNr = Base->Nr;
   m=0;
   for(TriangleMap::iterator runner = Base->triangles.begin(); runner != Base->triangles.end(); runner++) {
-    *out << Verbose(3) << "INFO: Deleting triangle " << *(runner->second) << "." << endl;
+    Log() << Verbose(3) << "INFO: Deleting triangle " << *(runner->second) << "." << endl;
     OldTriangleNrs[m++] = runner->second->Nr;
     RemoveTesselationTriangle(runner->second);
@@ -2115 +2116 @@
   NewLine = new class BoundaryLineSet(BPS, OldBaseLineNr);
   LinesOnBoundary.insert(LinePair(OldBaseLineNr, NewLine)); // no need for check for unique insertion as NewLine is definitely a new one
-  *out << Verbose(3) << "INFO: Created new baseline " << *NewLine << "." << endl;
+  Log() << Verbose(3) << "INFO: Created new baseline " << *NewLine << "." << endl;
 
   // construct new triangles with flipped baseline
@@ -2130 +2131 @@
     BTS->GetNormalVector(BaseLineNormal);
     AddTesselationTriangle(OldTriangleNrs[0]);
-    *out << Verbose(3) << "INFO: Created new triangle " << *BTS << "." << endl;
+    Log() << Verbose(3) << "INFO: Created new triangle " << *BTS << "." << endl;
 
     BLS[0] = (i==2 ? OldLines[3] : OldLines[2]);
@@ -2138 +2139 @@
     BTS->GetNormalVector(BaseLineNormal);
     AddTesselationTriangle(OldTriangleNrs[1]);
-    *out << Verbose(3) << "INFO: Created new triangle " << *BTS << "." << endl;
+    Log() << Verbose(3) << "INFO: Created new triangle " << *BTS << "." << endl;
   } else {
-    *out << Verbose(1) << "The four old lines do not connect, something's utterly wrong here!" << endl;
+    Log() << Verbose(1) << "The four old lines do not connect, something's utterly wrong here!" << endl;
     return NULL;
   }
 
-  *out << Verbose(1) << "End of FlipBaseline" << endl;
+  Log() << Verbose(1) << "End of FlipBaseline" << endl;
   return NewLine;
 };
@@ -2159 +2160 @@
 void Tesselation::FindSecondPointForTesselation(TesselPoint* a, Vector Oben, TesselPoint*& OptCandidate, double Storage[3], double RADIUS, const LinkedCell *LC)
 {
-  cout << Verbose(2) << "Begin of FindSecondPointForTesselation" << endl;
+  Log() << Verbose(2) << "Begin of FindSecondPointForTesselation" << endl;
   Vector AngleCheck;
   class TesselPoint* Candidate = NULL;
@@ -2172 +2173 @@
       N[i] = LC->n[i];
   } else {
-    cerr << "ERROR: Point " << *a << " is not found in cell " << LC->index << "." << endl;
+    eLog() << Verbose(0) << "ERROR: Point " << *a << " is not found in cell " << LC->index << "." << endl;
     return;
   }
   // then go through the current and all neighbouring cells and check the contained points for possible candidates
-  cout << Verbose(3) << "LC Intervals from [";
+  Log() << Verbose(3) << "LC Intervals from [";
   for (int i=0;i<NDIM;i++) {
-  cout << " " << N[i] << "<->" << LC->N[i];
-  }
-  cout << "] :";
+  Log() << Verbose(0) << " " << N[i] << "<->" << LC->N[i];
+  }
+  Log() << Verbose(0) << "] :";
   for (int i=0;i<NDIM;i++) {
     Nlower[i] = ((N[i]-1) >= 0) ? N[i]-1 : 0;
     Nupper[i] = ((N[i]+1) < LC->N[i]) ? N[i]+1 : LC->N[i]-1;
-    cout << " [" << Nlower[i] << "," << Nupper[i] << "] ";
-  }
-  cout << endl;
+    Log() << Verbose(0) << " [" << Nlower[i] << "," << Nupper[i] << "] ";
+  }
+  Log() << Verbose(0) << endl;
 
 
@@ -2193 +2194 @@
       for (LC->n[2] = Nlower[2]; LC->n[2] <= Nupper[2]; LC->n[2]++) {
         const LinkedNodes *List = LC->GetCurrentCell();
-        //cout << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
+        //Log() << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
         if (List != NULL) {
           for (LinkedNodes::const_iterator Runner = List->begin(); Runner != List->end(); Runner++) {
@@ -2224 +2225 @@
                 angle = AngleCheck.Angle(&Oben);
                 if (angle < Storage[0]) {
-                  //cout << Verbose(3) << "Old values of Storage: %lf %lf \n", Storage[0], Storage[1]);
-                  cout << Verbose(3) << "Current candidate is " << *Candidate << ": Is a better candidate with distance " << norm << " and angle " << angle << " to oben " << Oben << ".\n";
+                  //Log() << Verbose(3) << "Old values of Storage: %lf %lf \n", Storage[0], Storage[1]);
+                  Log() << Verbose(3) << "Current candidate is " << *Candidate << ": Is a better candidate with distance " << norm << " and angle " << angle << " to oben " << Oben << ".\n";
                   OptCandidate = Candidate;
                   Storage[0] = angle;
-                  //cout << Verbose(3) << "Changing something in Storage: %lf %lf. \n", Storage[0], Storage[2]);
+                  //Log() << Verbose(3) << "Changing something in Storage: %lf %lf. \n", Storage[0], Storage[2]);
                 } else {
-                  //cout << Verbose(3) << "Current candidate is " << *Candidate << ": Looses with angle " << angle << " to a better candidate " << *OptCandidate << endl;
+                  //Log() << Verbose(3) << "Current candidate is " << *Candidate << ": Looses with angle " << angle << " to a better candidate " << *OptCandidate << endl;
                 }
               } else {
-                //cout << Verbose(3) << "Current candidate is " << *Candidate << ": Refused due to Radius " << norm << endl;
+                //Log() << Verbose(3) << "Current candidate is " << *Candidate << ": Refused due to Radius " << norm << endl;
               }
             } else {
-              //cout << Verbose(3) << "Current candidate is " << *Candidate << ": Candidate is equal to first endpoint." << *a << "." << endl;
+              //Log() << Verbose(3) << "Current candidate is " << *Candidate << ": Candidate is equal to first endpoint." << *a << "." << endl;
             }
           }
         } else {
-          cout << Verbose(3) << "Linked cell list is empty." << endl;
+          Log() << Verbose(3) << "Linked cell list is empty." << endl;
         }
       }
-  cout << Verbose(2) << "End of FindSecondPointForTesselation" << endl;
+  Log() << Verbose(2) << "End of FindSecondPointForTesselation" << endl;
 };
 
@@ -2295 +2296 @@
   CandidateForTesselation *optCandidate = NULL;
 
-  cout << Verbose(1) << "Begin of FindThirdPointForTesselation" << endl;
-
-  cout << Verbose(2) << "INFO: NormalVector of BaseTriangle is " << NormalVector << "." << endl;
+  Log() << Verbose(1) << "Begin of FindThirdPointForTesselation" << endl;
+
+  Log() << Verbose(2) << "INFO: NormalVector of BaseTriangle is " << NormalVector << "." << endl;
 
   // construct center of circle
@@ -2313 +2314 @@
     CircleRadius = RADIUS*RADIUS - radius/4.;
     CirclePlaneNormal.Normalize();
-    //cout << Verbose(2) << "INFO: CircleCenter is at " << CircleCenter << ", CirclePlaneNormal is " << CirclePlaneNormal << " with circle radius " << sqrt(CircleRadius) << "." << endl;
+    //Log() << Verbose(2) << "INFO: CircleCenter is at " << CircleCenter << ", CirclePlaneNormal is " << CirclePlaneNormal << " with circle radius " << sqrt(CircleRadius) << "." << endl;
 
     // test whether old center is on the band's plane
     if (fabs(OldSphereCenter.ScalarProduct(&CirclePlaneNormal)) > HULLEPSILON) {
-      cerr << "ERROR: Something's very wrong here: OldSphereCenter is not on the band's plane as desired by " << fabs(OldSphereCenter.ScalarProduct(&CirclePlaneNormal)) << "!" << endl;
+      eLog() << Verbose(0) << "ERROR: Something's very wrong here: OldSphereCenter is not on the band's plane as desired by " << fabs(OldSphereCenter.ScalarProduct(&CirclePlaneNormal)) << "!" << endl;
       OldSphereCenter.ProjectOntoPlane(&CirclePlaneNormal);
     }
     radius = OldSphereCenter.ScalarProduct(&OldSphereCenter);
     if (fabs(radius - CircleRadius) < HULLEPSILON) {
-      //cout << Verbose(2) << "INFO: OldSphereCenter is at " << OldSphereCenter << "." << endl;
+      //Log() << Verbose(2) << "INFO: OldSphereCenter is at " << OldSphereCenter << "." << endl;
 
       // check SearchDirection
-      //cout << Verbose(2) << "INFO: SearchDirection is " << SearchDirection << "." << endl;
+      //Log() << Verbose(2) << "INFO: SearchDirection is " << SearchDirection << "." << endl;
       if (fabs(OldSphereCenter.ScalarProduct(&SearchDirection)) > HULLEPSILON) {  // rotated the wrong way!
-        cerr << "ERROR: SearchDirection and RelativeOldSphereCenter are not orthogonal!" << endl;
+        eLog() << Verbose(0) << "ERROR: SearchDirection and RelativeOldSphereCenter are not orthogonal!" << endl;
       }
 
@@ -2334 +2335 @@
         for(int i=0;i<NDIM;i++) // store indices of this cell
         N[i] = LC->n[i];
-        //cout << Verbose(2) << "INFO: Center cell is " << N[0] << ", " << N[1] << ", " << N[2] << " with No. " << LC->index << "." << endl;
+        //Log() << Verbose(2) << "INFO: Center cell is " << N[0] << ", " << N[1] << ", " << N[2] << " with No. " << LC->index << "." << endl;
       } else {
-        cerr << "ERROR: Vector " << CircleCenter << " is outside of LinkedCell's bounding box." << endl;
+        eLog() << Verbose(0) << "ERROR: Vector " << CircleCenter << " is outside of LinkedCell's bounding box." << endl;
         return;
       }
       // then go through the current and all neighbouring cells and check the contained points for possible candidates
-      //cout << Verbose(2) << "LC Intervals:";
+      //Log() << Verbose(2) << "LC Intervals:";
       for (int i=0;i<NDIM;i++) {
         Nlower[i] = ((N[i]-1) >= 0) ? N[i]-1 : 0;
         Nupper[i] = ((N[i]+1) < LC->N[i]) ? N[i]+1 : LC->N[i]-1;
-        //cout << " [" << Nlower[i] << "," << Nupper[i] << "] ";
+        //Log() << Verbose(0) << " [" << Nlower[i] << "," << Nupper[i] << "] ";
       }
-      //cout << endl;
+      //Log() << Verbose(0) << endl;
       for (LC->n[0] = Nlower[0]; LC->n[0] <= Nupper[0]; LC->n[0]++)
         for (LC->n[1] = Nlower[1]; LC->n[1] <= Nupper[1]; LC->n[1]++)
           for (LC->n[2] = Nlower[2]; LC->n[2] <= Nupper[2]; LC->n[2]++) {
             const LinkedNodes *List = LC->GetCurrentCell();
-            //cout << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
+            //Log() << Verbose(2) << "Current cell is " << LC->n[0] << ", " << LC->n[1] << ", " << LC->n[2] << " with No. " << LC->index << "." << endl;
             if (List != NULL) {
               for (LinkedNodes::const_iterator Runner = List->begin(); Runner != List->end(); Runner++) {
@@ -2357 +2358 @@
 
                 // check for three unique points
-                //cout << Verbose(2) << "INFO: Current Candidate is " << *Candidate << " at " << Candidate->node << "." << endl;
+                //Log() << Verbose(2) << "INFO: Current Candidate is " << *Candidate << " at " << Candidate->node << "." << endl;
                 if ((Candidate != BaseLine->endpoints[0]->node) && (Candidate != BaseLine->endpoints[1]->node) ){
 
@@ -2368 +2369 @@
                   ) {
                     helper.CopyVector(&NewNormalVector);
-                    //cout << Verbose(2) << "INFO: NewNormalVector is " << NewNormalVector << "." << endl;
+                    //Log() << Verbose(2) << "INFO: NewNormalVector is " << NewNormalVector << "." << endl;
                     radius = BaseLine->endpoints[0]->node->node->DistanceSquared(&NewSphereCenter);
                     if (radius < RADIUS*RADIUS) {
                       helper.Scale(sqrt(RADIUS*RADIUS - radius));
-                      //cout << Verbose(2) << "INFO: Distance of NewCircleCenter to NewSphereCenter is " << helper.Norm() << " with sphere radius " << RADIUS << "." << endl;
+                      //Log() << Verbose(2) << "INFO: Distance of NewCircleCenter to NewSphereCenter is " << helper.Norm() << " with sphere radius " << RADIUS << "." << endl;
                       NewSphereCenter.AddVector(&helper);
                       NewSphereCenter.SubtractVector(&CircleCenter);
-                      //cout << Verbose(2) << "INFO: NewSphereCenter is at " << NewSphereCenter << "." << endl;
+                      //Log() << Verbose(2) << "INFO: NewSphereCenter is at " << NewSphereCenter << "." << endl;
 
                       // OtherNewSphereCenter is created by the same vector just in the other direction
@@ -2381 +2382 @@
                       OtherNewSphereCenter.AddVector(&helper);
                       OtherNewSphereCenter.SubtractVector(&CircleCenter);
-                      //cout << Verbose(2) << "INFO: OtherNewSphereCenter is at " << OtherNewSphereCenter << "." << endl;
+                      //Log() << Verbose(2) << "INFO: OtherNewSphereCenter is at " << OtherNewSphereCenter << "." << endl;
 
                       alpha = GetPathLengthonCircumCircle(CircleCenter, CirclePlaneNormal, CircleRadius, NewSphereCenter, OldSphereCenter, NormalVector, SearchDirection);
@@ -2400 +2401 @@
                         if ((*ShortestAngle - HULLEPSILON) < alpha) {
                           candidates->push_back(optCandidate);
-                          cout << Verbose(2) << "ACCEPT: We have found an equally good candidate: " << *(optCandidate->point) << " with "
+                          Log() << Verbose(2) << "ACCEPT: We have found an equally good candidate: " << *(optCandidate->point) << " with "
                             << alpha << " and circumsphere's center at " << optCandidate->OptCenter << "." << endl;
                         } else {
@@ -2411 +2412 @@
                           candidates->clear();
                           candidates->push_back(optCandidate);
-                          cout << Verbose(2) << "ACCEPT: We have found a better candidate: " << *(optCandidate->point) << " with "
+                          Log() << Verbose(2) << "ACCEPT: We have found a better candidate: " << *(optCandidate->point) << " with "
                             << alpha << " and circumsphere's center at " << optCandidate->OptCenter << "." << endl;
                         }
                         *ShortestAngle = alpha;
-                        //cout << Verbose(2) << "INFO: There are " << candidates->size() << " candidates in the list now." << endl;
+                        //Log() << Verbose(2) << "INFO: There are " << candidates->size() << " candidates in the list now." << endl;
                       } else {
                         if ((optCandidate != NULL) && (optCandidate->point != NULL)) {
-                          //cout << Verbose(2) << "REJECT: Old candidate " << *(optCandidate->point) << " with " << *ShortestAngle << " is better than new one " << *Candidate << " with " << alpha << " ." << endl;
+                          //Log() << Verbose(2) << "REJECT: Old candidate " << *(optCandidate->point) << " with " << *ShortestAngle << " is better than new one " << *Candidate << " with " << alpha << " ." << endl;
                         } else {
-                          //cout << Verbose(2) << "REJECT: Candidate " << *Candidate << " with " << alpha << " was rejected." << endl;
+                          //Log() << Verbose(2) << "REJECT: Candidate " << *Candidate << " with " << alpha << " was rejected." << endl;
                         }
                       }
 
                     } else {
-                      //cout << Verbose(2) << "REJECT: NewSphereCenter " << NewSphereCenter << " for " << *Candidate << " is too far away: " << radius << "." << endl;
+                      //Log() << Verbose(2) << "REJECT: NewSphereCenter " << NewSphereCenter << " for " << *Candidate << " is too far away: " << radius << "." << endl;
                     }
                   } else {
-                    //cout << Verbose(2) << "REJECT: Three points from " << *BaseLine << " and Candidate " << *Candidate << " are linear-dependent." << endl;
+                    //Log() << Verbose(2) << "REJECT: Three points from " << *BaseLine << " and Candidate " << *Candidate << " are linear-dependent." << endl;
                   }
                 } else {
                   if (ThirdNode != NULL) {
-                    //cout << Verbose(2) << "REJECT: Base triangle " << *BaseLine << " and " << *ThirdNode << " contains Candidate " << *Candidate << "." << endl;
+                    //Log() << Verbose(2) << "REJECT: Base triangle " << *BaseLine << " and " << *ThirdNode << " contains Candidate " << *Candidate << "." << endl;
                   } else {
-                    //cout << Verbose(2) << "REJECT: Base triangle " << *BaseLine << " contains Candidate " << *Candidate << "." << endl;
+                    //Log() << Verbose(2) << "REJECT: Base triangle " << *BaseLine << " contains Candidate " << *Candidate << "." << endl;
                   }
                 }
@@ -2441 +2442 @@
           }
     } else {
-      cerr << Verbose(2) << "ERROR: The projected center of the old sphere has radius " << radius << " instead of " << CircleRadius << "." << endl;
+      eLog() << Verbose(2) << "ERROR: The projected center of the old sphere has radius " << radius << " instead of " << CircleRadius << "." << endl;
     }
   } else {
     if (ThirdNode != NULL)
-      cout << Verbose(2) << "Circumcircle for base line " << *BaseLine << " and third node " << *ThirdNode << " is too big!" << endl;
+      Log() << Verbose(2) << "Circumcircle for base line " << *BaseLine << " and third node " << *ThirdNode << " is too big!" << endl;
     else
-      cout << Verbose(2) << "Circumcircle for base line " << *BaseLine << " is too big!" << endl;
-  }
-
-  //cout << Verbose(2) << "INFO: Sorting candidate list ..." << endl;
+      Log() << Verbose(2) << "Circumcircle for base line " << *BaseLine << " is too big!" << endl;
+  }
+
+  //Log() << Verbose(2) << "INFO: Sorting candidate list ..." << endl;
   if (candidates->size() > 1) {
     candidates->unique();
@@ -2456 +2457 @@
   }
 
-  cout << Verbose(1) << "End of FindThirdPointForTesselation" << endl;
+  Log() << Verbose(1) << "End of FindThirdPointForTesselation" << endl;
 };
 
@@ -2479 +2480 @@
           { // if insertion fails, we have common endpoint
             node = OrderTest.first->second;
-            cout << Verbose(5) << "Common endpoint of lines " << *line1
+            Log() << Verbose(5) << "Common endpoint of lines " << *line1
                 << " and " << *line2 << " is: " << *node << "." << endl;
             j = 2;
@@ -2494 +2495 @@
  * \return list of BoundaryTriangleSet of nearest triangles or NULL in degenerate case.
  */
-list<BoundaryTriangleSet*> * Tesselation::FindClosestTrianglesToPoint(ofstream *out, const Vector *x, const LinkedCell* LC) const
+list<BoundaryTriangleSet*> * Tesselation::FindClosestTrianglesToPoint(const Vector *x, const LinkedCell* LC) const
 {
   TesselPoint *trianglePoints[3];
@@ -2501 +2502 @@
 
   if (LinesOnBoundary.empty()) {
-    *out << Verbose(0) << "Error: There is no tesselation structure to compare the point with, please create one first.";
+    Log() << Verbose(0) << "Error: There is no tesselation structure to compare the point with, please create one first.";
     return NULL;
   }
-  *out << Verbose(1) << "Finding closest Tesselpoint to " << *x << " ... " << endl;
+  Log() << Verbose(1) << "Finding closest Tesselpoint to " << *x << " ... " << endl;
   trianglePoints[0] = FindClosestPoint(x, SecondPoint, LC);
   
   // check whether closest point is "too close" :), then it's inside
   if (trianglePoints[0] == NULL) {
-    *out << Verbose(2) << "Is the only point, no one else is closeby." << endl;
+    Log() << Verbose(2) << "Is the only point, no one else is closeby." << endl;
     return NULL;
   }
   if (trianglePoints[0]->node->DistanceSquared(x) < MYEPSILON) {
-    *out << Verbose(3) << "Point is right on a tesselation point, no nearest triangle." << endl;
+    Log() << Verbose(3) << "Point is right on a tesselation point, no nearest triangle." << endl;
     PointMap::const_iterator PointRunner = PointsOnBoundary.find(trianglePoints[0]->nr);
     triangles = new list<BoundaryTriangleSet*>;
@@ -2532 +2533 @@
         triangles->unique();
       } else {
-        *out << Verbose(1) << "ERROR: I cannot find a boundary point to the tessel point " << *trianglePoints[0] << "." << endl;
+        Log() << Verbose(1) << "ERROR: I cannot find a boundary point to the tessel point " << *trianglePoints[0] << "." << endl;
         return NULL;
       }
     }
   } else {
-    list<TesselPoint*> *connectedClosestPoints = GetCircleOfConnectedPoints(out, trianglePoints[0], x);
+    list<TesselPoint*> *connectedClosestPoints = GetCircleOfConnectedPoints(trianglePoints[0], x);
     if (connectedClosestPoints != NULL) {
       trianglePoints[1] = connectedClosestPoints->front();
@@ -2543 +2544 @@
       for (int i=0;i<3;i++) {
         if (trianglePoints[i] == NULL) {
-          *out << Verbose(1) << "ERROR: IsInnerPoint encounters serious error, point " << i << " not found." << endl;
+          Log() << Verbose(1) << "ERROR: IsInnerPoint encounters serious error, point " << i << " not found." << endl;
         }
-        //*out << Verbose(2) << "List of triangle points:" << endl;
-        //*out << Verbose(3) << *trianglePoints[i] << endl;
+        //Log() << Verbose(2) << "List of triangle points:" << endl;
+        //Log() << Verbose(3) << *trianglePoints[i] << endl;
       }
 
       triangles = FindTriangles(trianglePoints);
-      *out << Verbose(2) << "List of possible triangles:" << endl;
+      Log() << Verbose(2) << "List of possible triangles:" << endl;
       for(list<BoundaryTriangleSet*>::iterator Runner = triangles->begin(); Runner != triangles->end(); Runner++)
-        *out << Verbose(3) << **Runner << endl;
+        Log() << Verbose(3) << **Runner << endl;
 
       delete(connectedClosestPoints);
     } else {
       triangles = NULL;
-      *out << Verbose(1) << "There is no circle of connected points!" << endl;
+      Log() << Verbose(1) << "There is no circle of connected points!" << endl;
     }
   }
   
   if ((triangles == NULL) || (triangles->empty())) {
-    *out << Verbose(0) << "ERROR: There is no nearest triangle. Please check the tesselation structure.";
+    Log() << Verbose(0) << "ERROR: There is no nearest triangle. Please check the tesselation structure.";
     delete(triangles);
     return NULL;
@@ -2575 +2576 @@
  * \return list of BoundaryTriangleSet of nearest triangles or NULL.
  */
-class BoundaryTriangleSet * Tesselation::FindClosestTriangleToPoint(ofstream *out, const Vector *x, const LinkedCell* LC) const
+class BoundaryTriangleSet * Tesselation::FindClosestTriangleToPoint(const Vector *x, const LinkedCell* LC) const
 {
   class BoundaryTriangleSet *result = NULL;
-  list<BoundaryTriangleSet*> *triangles = FindClosestTrianglesToPoint(out, x, LC);
+  list<BoundaryTriangleSet*> *triangles = FindClosestTrianglesToPoint(x, LC);
   Vector Center;
 
@@ -2586 +2587 @@
   if (triangles->size() == 1) { // there is no degenerate case
     result = triangles->front();
-    *out << Verbose(2) << "Normal Vector of this triangle is " << result->NormalVector << "." << endl;
+    Log() << Verbose(2) << "Normal Vector of this triangle is " << result->NormalVector << "." << endl;
   } else {
     result = triangles->front();
     result->GetCenter(&Center);
     Center.SubtractVector(x);
-    *out << Verbose(2) << "Normal Vector of this front side is " << result->NormalVector << "." << endl;
+    Log() << Verbose(2) << "Normal Vector of this front side is " << result->NormalVector << "." << endl;
     if (Center.ScalarProduct(&result->NormalVector) < 0) {
       result = triangles->back();
-      *out << Verbose(2) << "Normal Vector of this back side is " << result->NormalVector << "." << endl;
+      Log() << Verbose(2) << "Normal Vector of this back side is " << result->NormalVector << "." << endl;
       if (Center.ScalarProduct(&result->NormalVector) < 0) {
-        *out << Verbose(1) << "ERROR: Front and back side yield NormalVector in wrong direction!" << endl;
+        Log() << Verbose(1) << "ERROR: Front and back side yield NormalVector in wrong direction!" << endl;
       }
     }
@@ -2611 +2612 @@
  * @return true if the point is inside the tesselation structure, false otherwise
  */
-bool Tesselation::IsInnerPoint(ofstream *out, const Vector &Point, const LinkedCell* const LC) const
-{
-  class BoundaryTriangleSet *result = FindClosestTriangleToPoint(out, &Point, LC);
+bool Tesselation::IsInnerPoint(const Vector &Point, const LinkedCell* const LC) const
+{
+  class BoundaryTriangleSet *result = FindClosestTriangleToPoint(&Point, LC);
   Vector Center;
 
   if (result == NULL) {// is boundary point or only point in point cloud?
-    *out << Verbose(1) << Point << " is the only point in vicinity." << endl;
+    Log() << Verbose(1) << Point << " is the only point in vicinity." << endl;
     return false;
   }
 
   result->GetCenter(&Center);
-  *out << Verbose(3) << "INFO: Central point of the triangle is " << Center << "." << endl;
+  Log() << Verbose(3) << "INFO: Central point of the triangle is " << Center << "." << endl;
   Center.SubtractVector(&Point);
-  *out << Verbose(3) << "INFO: Vector from center to point to test is " << Center << "." << endl;
+  Log() << Verbose(3) << "INFO: Vector from center to point to test is " << Center << "." << endl;
   if (Center.ScalarProduct(&result->NormalVector) > -MYEPSILON) {
-    *out << Verbose(1) << Point << " is an inner point." << endl;
+    Log() << Verbose(1) << Point << " is an inner point." << endl;
     return true;
   } else {
-    *out << Verbose(1) << Point << " is NOT an inner point." << endl;
+    Log() << Verbose(1) << Point << " is NOT an inner point." << endl;
     return false;
   }
@@ -2641 +2642 @@
  * @return true if the point is inside the tesselation structure, false otherwise
  */
-bool Tesselation::IsInnerPoint(ofstream *out, const TesselPoint * const Point, const LinkedCell* const LC) const
-{
-  return IsInnerPoint(out, *(Point->node), LC);
+bool Tesselation::IsInnerPoint(const TesselPoint * const Point, const LinkedCell* const LC) const
+{
+  return IsInnerPoint(*(Point->node), LC);
 }
 
@@ -2652 +2653 @@
  * @return set of the all points linked to the provided one
  */
-set<TesselPoint*> * Tesselation::GetAllConnectedPoints(ofstream *out, const TesselPoint* const Point) const
+set<TesselPoint*> * Tesselation::GetAllConnectedPoints(const TesselPoint* const Point) const
 {
   set<TesselPoint*> *connectedPoints = new set<TesselPoint*>;
@@ -2659 +2660 @@
   bool takePoint = false;
 
-  *out << Verbose(3) << "Begin of GetAllConnectedPoints" << endl;
+  Log() << Verbose(3) << "Begin of GetAllConnectedPoints" << endl;
 
   // find the respective boundary point
@@ -2666 +2667 @@
     ReferencePoint = PointRunner->second;
   } else {
-    *out << Verbose(2) << "GetAllConnectedPoints() could not find the BoundaryPoint belonging to " << *Point << "." << endl;
+    Log() << Verbose(2) << "GetAllConnectedPoints() could not find the BoundaryPoint belonging to " << *Point << "." << endl;
     ReferencePoint = NULL;
   }
@@ -2690 +2691 @@
 
    if (takePoint) {
-     *out << Verbose(5) << "INFO: Endpoint " << *current << " of line " << *(findLines->second) << " is enlisted." << endl;
+     Log() << Verbose(5) << "INFO: Endpoint " << *current << " of line " << *(findLines->second) << " is enlisted." << endl;
      connectedPoints->insert(current);
    }
@@ -2698 +2699 @@
 
   if (connectedPoints->size() == 0) { // if have not found any points
-    *out << Verbose(1) << "ERROR: We have not found any connected points to " << *Point<< "." << endl;
+    Log() << Verbose(1) << "ERROR: We have not found any connected points to " << *Point<< "." << endl;
     return NULL;
   }
 
-  *out << Verbose(3) << "End of GetAllConnectedPoints" << endl;
+  Log() << Verbose(3) << "End of GetAllConnectedPoints" << endl;
   return connectedPoints;
 };
@@ -2718 +2719 @@
  * @return list of the all points linked to the provided one
  */
-list<TesselPoint*> * Tesselation::GetCircleOfConnectedPoints(ofstream *out, const TesselPoint* const Point, const Vector * const Reference) const
+list<TesselPoint*> * Tesselation::GetCircleOfConnectedPoints(const TesselPoint* const Point, const Vector * const Reference) const
 {
   map<double, TesselPoint*> anglesOfPoints;
-  set<TesselPoint*> *connectedPoints = GetAllConnectedPoints(out, Point);
+  set<TesselPoint*> *connectedPoints = GetAllConnectedPoints(Point);
   list<TesselPoint*> *connectedCircle = new list<TesselPoint*>;
   Vector center;
@@ -2730 +2731 @@
 
   if (connectedPoints == NULL) {
-    *out << Verbose(2) << "Could not find any connected points!" << endl;
+    Log() << Verbose(2) << "Could not find any connected points!" << endl;
     delete(connectedCircle);
     return NULL;
   }
-  *out << Verbose(2) << "Begin of GetCircleOfConnectedPoints" << endl;
+  Log() << Verbose(2) << "Begin of GetCircleOfConnectedPoints" << endl;
 
   // calculate central point
   for (set<TesselPoint*>::const_iterator TesselRunner = connectedPoints->begin(); TesselRunner != connectedPoints->end(); TesselRunner++)
     center.AddVector((*TesselRunner)->node);
-  //*out << "Summed vectors " << center << "; number of points " << connectedPoints.size()
+  //Log() << Verbose(0) << "Summed vectors " << center << "; number of points " << connectedPoints.size()
   //  << "; scale factor " << 1.0/connectedPoints.size();
   center.Scale(1.0/connectedPoints->size());
-  *out << Verbose(4) << "INFO: Calculated center of all circle points is " << center << "." << endl;
+  Log() << Verbose(4) << "INFO: Calculated center of all circle points is " << center << "." << endl;
 
   // projection plane of the circle is at the closes Point and normal is pointing away from center of all circle points
@@ -2748 +2749 @@
   PlaneNormal.SubtractVector(&center);
   PlaneNormal.Normalize();
-  *out << Verbose(4) << "INFO: Calculated plane normal of circle is " << PlaneNormal << "." << endl;
+  Log() << Verbose(4) << "INFO: Calculated plane normal of circle is " << PlaneNormal << "." << endl;
 
   // construct one orthogonal vector
@@ -2757 +2758 @@
   }
   if ((Reference == NULL) || (AngleZero.NormSquared() < MYEPSILON )) {
-    *out << Verbose(4) << "Using alternatively " << *(*connectedPoints->begin())->node << " as angle 0 referencer." << endl;
+    Log() << Verbose(4) << "Using alternatively " << *(*connectedPoints->begin())->node << " as angle 0 referencer." << endl;
     AngleZero.CopyVector((*connectedPoints->begin())->node);
     AngleZero.SubtractVector(Point->node);
     AngleZero.ProjectOntoPlane(&PlaneNormal);
     if (AngleZero.NormSquared() < MYEPSILON) {
-      cerr << Verbose(0) << "CRITIAL: AngleZero is 0 even with alternative reference. The algorithm has to be changed here!" << endl;
+      eLog() << Verbose(0) << "CRITIAL: AngleZero is 0 even with alternative reference. The algorithm has to be changed here!" << endl;
       performCriticalExit();
     }
   }
-  *out << Verbose(4) << "INFO: Reference vector on this plane representing angle 0 is " << AngleZero << "." << endl;
+  Log() << Verbose(4) << "INFO: Reference vector on this plane representing angle 0 is " << AngleZero << "." << endl;
   if (AngleZero.NormSquared() > MYEPSILON)
     OrthogonalVector.MakeNormalVector(&PlaneNormal, &AngleZero);
   else
     OrthogonalVector.MakeNormalVector(&PlaneNormal);
-  *out << Verbose(4) << "INFO: OrthogonalVector on plane is " << OrthogonalVector << "." << endl;
+  Log() << Verbose(4) << "INFO: OrthogonalVector on plane is " << OrthogonalVector << "." << endl;
 
   // go through all connected points and calculate angle
@@ -2779 +2780 @@
     helper.ProjectOntoPlane(&PlaneNormal);
     double angle = GetAngle(helper, AngleZero, OrthogonalVector);
-    *out << Verbose(3) << "INFO: Calculated angle is " << angle << " for point " << **listRunner << "." << endl;
+    Log() << Verbose(3) << "INFO: Calculated angle is " << angle << " for point " << **listRunner << "." << endl;
     anglesOfPoints.insert(pair<double, TesselPoint*>(angle, (*listRunner)));
   }
@@ -2789 +2790 @@
   delete(connectedPoints);
 
-  *out << Verbose(2) << "End of GetCircleOfConnectedPoints" << endl;
+  Log() << Verbose(2) << "End of GetCircleOfConnectedPoints" << endl;
 
   return connectedCircle;
@@ -2800 +2801 @@
  * @return list of the all points linked to the provided one
  */
-list<list<TesselPoint*> *> * Tesselation::GetPathsOfConnectedPoints(ofstream *out, const TesselPoint* const Point) const
+list<list<TesselPoint*> *> * Tesselation::GetPathsOfConnectedPoints(const TesselPoint* const Point) const
 {
   map<double, TesselPoint*> anglesOfPoints;
@@ -2821 +2822 @@
     ReferencePoint = PointRunner->second;
   } else {
-    *out << Verbose(2) << "ERROR: GetPathOfConnectedPoints() could not find the BoundaryPoint belonging to " << *Point << "." << endl;
+    Log() << Verbose(2) << "ERROR: GetPathOfConnectedPoints() could not find the BoundaryPoint belonging to " << *Point << "." << endl;
     return NULL;
   }
@@ -2838 +2839 @@
       LineRunner = TouchedLine.find(runner->second);
       if (LineRunner == TouchedLine.end()) {
-        *out << Verbose(2) << "ERROR: I could not find " << *runner->second << " in the touched list." << endl;
+        Log() << Verbose(2) << "ERROR: I could not find " << *runner->second << " in the touched list." << endl;
       } else if (!LineRunner->second) {
         LineRunner->second = true;
@@ -2846 +2847 @@
         StartLine = CurrentLine;
         CurrentPoint = CurrentLine->GetOtherEndpoint(ReferencePoint);
-        *out << Verbose(3)<< "INFO: Beginning path retrieval at " << *CurrentPoint << " of line " << *CurrentLine << "." << endl;
+        Log() << Verbose(3)<< "INFO: Beginning path retrieval at " << *CurrentPoint << " of line " << *CurrentLine << "." << endl;
         do {
           // push current one
-          *out << Verbose(3) << "INFO: Putting " << *CurrentPoint << " at end of path." << endl;
+          Log() << Verbose(3) << "INFO: Putting " << *CurrentPoint << " at end of path." << endl;
           connectedPath->push_back(CurrentPoint->node);
 
           // find next triangle
           for (TriangleMap::iterator Runner = CurrentLine->triangles.begin(); Runner != CurrentLine->triangles.end(); Runner++) {
-            *out << Verbose(3) << "INFO: Inspecting triangle " << *Runner->second << "." << endl;
+            Log() << Verbose(3) << "INFO: Inspecting triangle " << *Runner->second << "." << endl;
             if ((Runner->second != triangle)) { // look for first triangle not equal to old one
               triangle = Runner->second;
@@ -2861 +2862 @@
                 if (!TriangleRunner->second) {
                   TriangleRunner->second = true;
-                  *out << Verbose(3) << "INFO: Connecting triangle is " << *triangle << "." << endl;
+                  Log() << Verbose(3) << "INFO: Connecting triangle is " << *triangle << "." << endl;
                   break;
                 } else {
-                  *out << Verbose(3) << "INFO: Skipping " << *triangle << ", as we have already visited it." << endl;
+                  Log() << Verbose(3) << "INFO: Skipping " << *triangle << ", as we have already visited it." << endl;
                   triangle = NULL;
                 }
               } else {
-                *out << Verbose(2) << "ERROR: I could not find " << *triangle << " in the touched list." << endl;
+                Log() << Verbose(2) << "ERROR: I could not find " << *triangle << " in the touched list." << endl;
                 triangle = NULL;
               }
@@ -2879 +2880 @@
             if ((triangle->lines[i] != CurrentLine) && (triangle->lines[i]->ContainsBoundaryPoint(ReferencePoint))) { // not the current line and still containing Point
               CurrentLine = triangle->lines[i];
-              *out << Verbose(3) << "INFO: Connecting line is " << *CurrentLine << "." << endl;
+              Log() << Verbose(3) << "INFO: Connecting line is " << *CurrentLine << "." << endl;
               break;
             }
@@ -2885 +2886 @@
           LineRunner = TouchedLine.find(CurrentLine);
           if (LineRunner == TouchedLine.end())
-            *out << Verbose(2) << "ERROR: I could not find " << *CurrentLine << " in the touched list." << endl;
+            Log() << Verbose(2) << "ERROR: I could not find " << *CurrentLine << " in the touched list." << endl;
           else
             LineRunner->second = true;
@@ -2893 +2894 @@
         } while (CurrentLine != StartLine);
         // last point is missing, as it's on start line
-        *out << Verbose(3) << "INFO: Putting " << *CurrentPoint << " at end of path." << endl;
+        Log() << Verbose(3) << "INFO: Putting " << *CurrentPoint << " at end of path." << endl;
         if (StartLine->GetOtherEndpoint(ReferencePoint)->node != connectedPath->back())
           connectedPath->push_back(StartLine->GetOtherEndpoint(ReferencePoint)->node);
@@ -2899 +2900 @@
         ListOfPaths->push_back(connectedPath);
       } else {
-        *out << Verbose(3) << "INFO: Skipping " << *runner->second << ", as we have already visited it." << endl;
+        Log() << Verbose(3) << "INFO: Skipping " << *runner->second << ", as we have already visited it." << endl;
       }
     }
   } else {
-    *out << Verbose(1) << "ERROR: There are no lines attached to " << *ReferencePoint << "." << endl;
+    Log() << Verbose(1) << "ERROR: There are no lines attached to " << *ReferencePoint << "." << endl;
   }
 
@@ -2915 +2916 @@
  * @return list of the closed paths
  */
-list<list<TesselPoint*> *> * Tesselation::GetClosedPathsOfConnectedPoints(ofstream *out, const TesselPoint* const Point) const
-{
-  list<list<TesselPoint*> *> *ListofPaths = GetPathsOfConnectedPoints(out, Point);
+list<list<TesselPoint*> *> * Tesselation::GetClosedPathsOfConnectedPoints(const TesselPoint* const Point) const
+{
+  list<list<TesselPoint*> *> *ListofPaths = GetPathsOfConnectedPoints(Point);
   list<list<TesselPoint*> *> *ListofClosedPaths = new list<list<TesselPoint*> *>;
   list<TesselPoint*> *connectedPath = NULL;
@@ -2930 +2931 @@
     connectedPath = *ListRunner;
 
-    *out << Verbose(2) << "INFO: Current path is " << connectedPath << "." << endl;
+    Log() << Verbose(2) << "INFO: Current path is " << connectedPath << "." << endl;
 
     // go through list, look for reappearance of starting Point and count
@@ -2940 +2941 @@
       if ((*CircleRunner == *CircleStart) && (CircleRunner != CircleStart)) { // is not the very first point
         // we have a closed circle from Marker to new Marker
-        *out << Verbose(3) << count+1 << ". closed path consists of: ";
+        Log() << Verbose(3) << count+1 << ". closed path consists of: ";
         newPath = new list<TesselPoint*>;
         list<TesselPoint*>::iterator CircleSprinter = Marker;
         for (; CircleSprinter != CircleRunner; CircleSprinter++) {
           newPath->push_back(*CircleSprinter);
-          *out << (**CircleSprinter) << " <-> ";
+          Log() << Verbose(0) << (**CircleSprinter) << " <-> ";
         }
-        *out << ".." << endl;
+        Log() << Verbose(0) << ".." << endl;
         count++;
         Marker = CircleRunner;
@@ -2956 +2957 @@
     }
   }
-  *out << Verbose(3) << "INFO: " << count << " closed additional path(s) have been created." << endl;
+  Log() << Verbose(3) << "INFO: " << count << " closed additional path(s) have been created." << endl;
 
   // delete list of paths
@@ -2976 +2977 @@
  * \return pointer to allocated list of triangles
  */
-set<BoundaryTriangleSet*> *Tesselation::GetAllTriangles(ofstream *out, const BoundaryPointSet * const Point) const
+set<BoundaryTriangleSet*> *Tesselation::GetAllTriangles(const BoundaryPointSet * const Point) const
 {
   set<BoundaryTriangleSet*> *connectedTriangles = new set<BoundaryTriangleSet*>;
 
   if (Point == NULL) {
-    *out << Verbose(1) << "ERROR: Point given is NULL." << endl;
+    Log() << Verbose(1) << "ERROR: Point given is NULL." << endl;
   } else {
     // go through its lines and insert all triangles
@@ -3005 +3006 @@
  * \return volume added to the volume inside the tesselated surface by the removal
  */
-double Tesselation::RemovePointFromTesselatedSurface(ofstream *out, class BoundaryPointSet *point) {
+double Tesselation::RemovePointFromTesselatedSurface(class BoundaryPointSet *point) {
   class BoundaryLineSet *line = NULL;
   class BoundaryTriangleSet *triangle = NULL;
@@ -3013 +3014 @@
 
   if (point == NULL) {
-    *out << Verbose(1) << "ERROR: Cannot remove the point " << point << ", it's NULL!" << endl;
+    Log() << Verbose(1) << "ERROR: Cannot remove the point " << point << ", it's NULL!" << endl;
     return 0.;
   } else
-    *out << Verbose(2) << "Removing point " << *point << " from tesselated boundary ..." << endl;
+    Log() << Verbose(2) << "Removing point " << *point << " from tesselated boundary ..." << endl;
 
   // copy old location for the volume
@@ -3023 +3024 @@
   // get list of connected points
   if (point->lines.empty()) {
-    *out << Verbose(1) << "ERROR: Cannot remove the point " << *point << ", it's connected to no lines!" << endl;
+    Log() << Verbose(1) << "ERROR: Cannot remove the point " << *point << ", it's connected to no lines!" << endl;
     return 0.;
   }
 
-  list<list<TesselPoint*> *> *ListOfClosedPaths = GetClosedPathsOfConnectedPoints(out, point->node);
+  list<list<TesselPoint*> *> *ListOfClosedPaths = GetClosedPathsOfConnectedPoints(point->node);
   list<TesselPoint*> *connectedPath = NULL;
 
@@ -3046 +3047 @@
   NormalVector.Zero();
   for (map<class BoundaryTriangleSet *, int>::iterator Runner = Candidates.begin(); Runner != Candidates.end(); Runner++) {
-    *out << Verbose(3) << "INFO: Removing triangle " << *(Runner->first) << "." << endl;
+    Log() << Verbose(3) << "INFO: Removing triangle " << *(Runner->first) << "." << endl;
     NormalVector.SubtractVector(&Runner->first->NormalVector); // has to point inward
     RemoveTesselationTriangle(Runner->first);
     count++;
   }
-  *out << Verbose(1) << count << " triangles were removed." << endl;
+  Log() << Verbose(1) << count << " triangles were removed." << endl;
 
   list<list<TesselPoint*> *>::iterator ListAdvance = ListOfClosedPaths->begin();
@@ -3076 +3077 @@
         smallestangle = 0.;
         for (MiddleNode = connectedPath->begin(); MiddleNode != connectedPath->end(); MiddleNode++) {
-          cout << Verbose(3) << "INFO: MiddleNode is " << **MiddleNode << "." << endl;
+          Log() << Verbose(3) << "INFO: MiddleNode is " << **MiddleNode << "." << endl;
           // construct vectors to next and previous neighbour
           StartNode = MiddleNode;
@@ -3082 +3083 @@
             StartNode = connectedPath->end();
           StartNode--;
-          //cout << Verbose(3) << "INFO: StartNode is " << **StartNode << "." << endl;
+          //Log() << Verbose(3) << "INFO: StartNode is " << **StartNode << "." << endl;
           Point.CopyVector((*StartNode)->node);
           Point.SubtractVector((*MiddleNode)->node);
@@ -3089 +3090 @@
           if (StartNode == connectedPath->end())
             StartNode = connectedPath->begin();
-          //cout << Verbose(3) << "INFO: EndNode is " << **StartNode << "." << endl;
+          //Log() << Verbose(3) << "INFO: EndNode is " << **StartNode << "." << endl;
           Reference.CopyVector((*StartNode)->node);
           Reference.SubtractVector((*MiddleNode)->node);
@@ -3104 +3105 @@
         MiddleNode = EndNode;
         if (MiddleNode == connectedPath->end()) {
-          cout << Verbose(1) << "CRITICAL: Could not find a smallest angle!" << endl;
+          Log() << Verbose(1) << "CRITICAL: Could not find a smallest angle!" << endl;
           exit(255);
         }
@@ -3114 +3115 @@
         if (EndNode == connectedPath->end())
           EndNode = connectedPath->begin();
-        cout << Verbose(4) << "INFO: StartNode is " << **StartNode << "." << endl;
-        cout << Verbose(4) << "INFO: MiddleNode is " << **MiddleNode << "." << endl;
-        cout << Verbose(4) << "INFO: EndNode is " << **EndNode << "." << endl;
-        *out << Verbose(3) << "INFO: Attempting to create triangle " << (*StartNode)->Name << ", " << (*MiddleNode)->Name << " and " << (*EndNode)->Name << "." << endl;
+        Log() << Verbose(4) << "INFO: StartNode is " << **StartNode << "." << endl;
+        Log() << Verbose(4) << "INFO: MiddleNode is " << **MiddleNode << "." << endl;
+        Log() << Verbose(4) << "INFO: EndNode is " << **EndNode << "." << endl;
+        Log() << Verbose(3) << "INFO: Attempting to create triangle " << (*StartNode)->Name << ", " << (*MiddleNode)->Name << " and " << (*EndNode)->Name << "." << endl;
         TriangleCandidates[0] = *StartNode;
         TriangleCandidates[1] = *MiddleNode;
         TriangleCandidates[2] = *EndNode;
-        triangle = GetPresentTriangle(out, TriangleCandidates);
+        triangle = GetPresentTriangle(TriangleCandidates);
         if (triangle != NULL) {
-          cout << Verbose(1) << "WARNING: New triangle already present, skipping!" << endl;
+          Log() << Verbose(1) << "WARNING: New triangle already present, skipping!" << endl;
           StartNode++;
           MiddleNode++;
@@ -3135 +3136 @@
           continue;
         }
-        *out << Verbose(5) << "Adding new triangle points."<< endl;
+        Log() << Verbose(5) << "Adding new triangle points."<< endl;
         AddTesselationPoint(*StartNode, 0);
         AddTesselationPoint(*MiddleNode, 1);
         AddTesselationPoint(*EndNode, 2);
-        *out << Verbose(5) << "Adding new triangle lines."<< endl;
+        Log() << Verbose(5) << "Adding new triangle lines."<< endl;
         AddTesselationLine(TPS[0], TPS[1], 0);
         AddTesselationLine(TPS[0], TPS[2], 1);
@@ -3154 +3155 @@
         // prepare nodes for next triangle
         StartNode = EndNode;
-        cout << Verbose(4) << "Removing " << **MiddleNode << " from closed path, remaining points: " << connectedPath->size() << "." << endl;
+        Log() << Verbose(4) << "Removing " << **MiddleNode << " from closed path, remaining points: " << connectedPath->size() << "." << endl;
         connectedPath->remove(*MiddleNode); // remove the middle node (it is surrounded by triangles)
         if (connectedPath->size() == 2) { // we are done
@@ -3161 +3162 @@
           break;
         } else if (connectedPath->size() < 2) { // something's gone wrong!
-          cout << Verbose(1) << "CRITICAL: There are only two endpoints left!" << endl;
+          Log() << Verbose(1) << "CRITICAL: There are only two endpoints left!" << endl;
           exit(255);
         } else {
@@ -3182 +3183 @@
           maxgain = 0;
           for(list<class BoundaryLineSet *>::iterator Runner = NewLines.begin(); Runner != NewLines.end(); Runner++) {
-            tmp = PickFarthestofTwoBaselines(out, *Runner);
+            tmp = PickFarthestofTwoBaselines(*Runner);
             if (maxgain < tmp) {
               maxgain = tmp;
@@ -3190 +3191 @@
           if (maxgain != 0) {
             volume += maxgain;
-            cout << Verbose(3) << "Flipping baseline with highest volume" << **Candidate << "." << endl;
-            OtherBase = FlipBaseline(out, *Candidate);
+            Log() << Verbose(3) << "Flipping baseline with highest volume" << **Candidate << "." << endl;
+            OtherBase = FlipBaseline(*Candidate);
             NewLines.erase(Candidate);
             NewLines.push_back(OtherBase);
@@ -3201 +3202 @@
       delete(connectedPath);
     }
-    *out << Verbose(1) << count << " triangles were created." << endl;
+    Log() << Verbose(1) << count << " triangles were created." << endl;
   } else {
     while (!ListOfClosedPaths->empty()) {
@@ -3209 +3210 @@
       delete(connectedPath);
     }
-    *out << Verbose(1) << "No need to create any triangles." << endl;
+    Log() << Verbose(1) << "No need to create any triangles." << endl;
   }
   delete(ListOfClosedPaths);
 
-  *out << Verbose(1) << "Removed volume is " << volume << "." << endl;
+  Log() << Verbose(1) << "Removed volume is " << volume << "." << endl;
 
   return volume;
@@ -3283 +3284 @@
   // sanity check
   if (LinesOnBoundary.empty()) {
-    cout << Verbose(1) << "Warning: FindAllDegeneratedTriangles() was called without any tesselation structure.";
+    Log() << Verbose(1) << "Warning: FindAllDegeneratedTriangles() was called without any tesselation structure.";
     return DegeneratedLines;
   }
@@ -3299 +3300 @@
   AllLines.clear();
 
-  cout << Verbose(1) << "FindAllDegeneratedLines() found " << DegeneratedLines->size() << " lines." << endl;
+  Log() << Verbose(1) << "FindAllDegeneratedLines() found " << DegeneratedLines->size() << " lines." << endl;
   map<int,int>::iterator it;
   for (it = DegeneratedLines->begin(); it != DegeneratedLines->end(); it++)
-      cout << Verbose(2) << (*it).first << " => " << (*it).second << endl;
+      Log() << Verbose(2) << (*it).first << " => " << (*it).second << endl;
 
   return DegeneratedLines;
@@ -3342 +3343 @@
   delete(DegeneratedLines);
 
-  cout << Verbose(1) << "FindAllDegeneratedTriangles() found " << DegeneratedTriangles->size() << " triangles:" << endl;
+  Log() << Verbose(1) << "FindAllDegeneratedTriangles() found " << DegeneratedTriangles->size() << " triangles:" << endl;
   map<int,int>::iterator it;
   for (it = DegeneratedTriangles->begin(); it != DegeneratedTriangles->end(); it++)
-      cout << Verbose(2) << (*it).first << " => " << (*it).second << endl;
+      Log() << Verbose(2) << (*it).first << " => " << (*it).second << endl;
 
   return DegeneratedTriangles;
@@ -3361 +3362 @@
   int count  = 0;
 
-  cout << Verbose(1) << "Begin of RemoveDegeneratedTriangles" << endl;
+  Log() << Verbose(1) << "Begin of RemoveDegeneratedTriangles" << endl;
 
   for (map<int, int>::iterator TriangleKeyRunner = DegeneratedTriangles->begin();
@@ -3420 +3421 @@
       // erase the pair
       count += (int) DegeneratedTriangles->erase(triangle->Nr);
-      cout << Verbose(1) << "RemoveDegeneratedTriangles() removes triangle " << *triangle << "." << endl;
+      Log() << Verbose(1) << "RemoveDegeneratedTriangles() removes triangle " << *triangle << "." << endl;
       RemoveTesselationTriangle(triangle);
       count += (int) DegeneratedTriangles->erase(partnerTriangle->Nr);
-      cout << Verbose(1) << "RemoveDegeneratedTriangles() removes triangle " << *partnerTriangle << "." << endl;
+      Log() << Verbose(1) << "RemoveDegeneratedTriangles() removes triangle " << *partnerTriangle << "." << endl;
       RemoveTesselationTriangle(partnerTriangle);
     } else {
-      cout << Verbose(1) << "RemoveDegeneratedTriangles() does not remove triangle " << *triangle
+      Log() << Verbose(1) << "RemoveDegeneratedTriangles() does not remove triangle " << *triangle
         << " and its partner " << *partnerTriangle << " because it is essential for at"
         << " least one of the endpoints to be kept in the tesselation structure." << endl;
@@ -3433 +3434 @@
   delete(DegeneratedTriangles);
 
-  cout << Verbose(1) << "RemoveDegeneratedTriangles() removed " << count << " triangles:" << endl;
-  cout << Verbose(1) << "End of RemoveDegeneratedTriangles" << endl;
+  Log() << Verbose(1) << "RemoveDegeneratedTriangles() removed " << count << " triangles:" << endl;
+  Log() << Verbose(1) << "End of RemoveDegeneratedTriangles" << endl;
 }
 
@@ -3445 +3446 @@
  * \param *LC Linked Cell structure to find nearest point
  */
-void Tesselation::AddBoundaryPointByDegeneratedTriangle(ofstream *out, class TesselPoint *point, LinkedCell *LC)
-{
-  *out << Verbose(2) << "Begin of AddBoundaryPointByDegeneratedTriangle" << endl;
+void Tesselation::AddBoundaryPointByDegeneratedTriangle(class TesselPoint *point, LinkedCell *LC)
+{
+  Log() << Verbose(2) << "Begin of AddBoundaryPointByDegeneratedTriangle" << endl;
 
   // find nearest boundary point
@@ -3461 +3462 @@
     NearestBoundaryPoint = PointRunner->second;
   } else {
-    *out << Verbose(1) << "ERROR: I cannot find the boundary point." << endl;
+    Log() << Verbose(1) << "ERROR: I cannot find the boundary point." << endl;
     return;
   }
-  *out << Verbose(2) << "Nearest point on boundary is " << NearestPoint->Name << "." << endl;
+  Log() << Verbose(2) << "Nearest point on boundary is " << NearestPoint->Name << "." << endl;
 
   // go through its lines and find the best one to split
@@ -3497 +3498 @@
 
   // create new triangle to connect point (connects automatically with the missing spot of the chosen line)
-  *out << Verbose(5) << "Adding new triangle points."<< endl;
+  Log() << Verbose(5) << "Adding new triangle points."<< endl;
   AddTesselationPoint((BestLine->endpoints[0]->node), 0);
   AddTesselationPoint((BestLine->endpoints[1]->node), 1);
   AddTesselationPoint(point, 2);
-  *out << Verbose(5) << "Adding new triangle lines."<< endl;
+  Log() << Verbose(5) << "Adding new triangle lines."<< endl;
   AddTesselationLine(TPS[0], TPS[1], 0);
   AddTesselationLine(TPS[0], TPS[2], 1);
@@ -3508 +3509 @@
   BTS->GetNormalVector(TempTriangle->NormalVector);
   BTS->NormalVector.Scale(-1.);
-  *out << Verbose(3) << "INFO: NormalVector of new triangle is " << BTS->NormalVector << "." << endl;
+  Log() << Verbose(3) << "INFO: NormalVector of new triangle is " << BTS->NormalVector << "." << endl;
   AddTesselationTriangle();
 
   // create other side of this triangle and close both new sides of the first created triangle
-  *out << Verbose(5) << "Adding new triangle points."<< endl;
+  Log() << Verbose(5) << "Adding new triangle points."<< endl;
   AddTesselationPoint((BestLine->endpoints[0]->node), 0);
   AddTesselationPoint((BestLine->endpoints[1]->node), 1);
   AddTesselationPoint(point, 2);
-  *out << Verbose(5) << "Adding new triangle lines."<< endl;
+  Log() << Verbose(5) << "Adding new triangle lines."<< endl;
   AddTesselationLine(TPS[0], TPS[1], 0);
   AddTesselationLine(TPS[0], TPS[2], 1);
@@ -3522 +3523 @@
   BTS = new class BoundaryTriangleSet(BLS, TrianglesOnBoundaryCount);
   BTS->GetNormalVector(TempTriangle->NormalVector);
-  *out << Verbose(3) << "INFO: NormalVector of other new triangle is " << BTS->NormalVector << "." << endl;
+  Log() << Verbose(3) << "INFO: NormalVector of other new triangle is " << BTS->NormalVector << "." << endl;
   AddTesselationTriangle();
 
@@ -3529 +3530 @@
     if ((BTS->lines[i]->ContainsBoundaryPoint(BestLine->endpoints[0])) && (BTS->lines[i]->ContainsBoundaryPoint(BestLine->endpoints[1]))) {
       if (BestLine == BTS->lines[i]){
-        *out << Verbose(1) << "CRITICAL: BestLine is same as found line, something's wrong here!" << endl;
+        Log() << Verbose(1) << "CRITICAL: BestLine is same as found line, something's wrong here!" << endl;
         exit(255);
       }
@@ -3539 +3540 @@
 
   // exit
-  *out << Verbose(2) << "End of AddBoundaryPointByDegeneratedTriangle" << endl;
+  Log() << Verbose(2) << "End of AddBoundaryPointByDegeneratedTriangle" << endl;
 };
 
@@ -3547 +3548 @@
  * \param *cloud PointCloud structure with all nodes
  */
-void Tesselation::Output(ofstream *out, const char *filename, const PointCloud * const cloud)
+void Tesselation::Output(const char *filename, const PointCloud * const cloud)
 {
   ofstream *tempstream = NULL;
@@ -3561 +3562 @@
       NameofTempFile.erase(npos, 1);
       NameofTempFile.append(TecplotSuffix);
-      *out << Verbose(1) << "Writing temporary non convex hull to file " << NameofTempFile << ".\n";
+      Log() << Verbose(1) << "Writing temporary non convex hull to file " << NameofTempFile << ".\n";
       tempstream = new ofstream(NameofTempFile.c_str(), ios::trunc);
-      WriteTecplotFile(out, tempstream, this, cloud, TriangleFilesWritten);
+      WriteTecplotFile(tempstream, this, cloud, TriangleFilesWritten);
       tempstream->close();
       tempstream->flush();
@@ -3575 +3576 @@
       NameofTempFile.erase(npos, 1);
       NameofTempFile.append(Raster3DSuffix);
-      *out << Verbose(1) << "Writing temporary non convex hull to file " << NameofTempFile << ".\n";
+      Log() << Verbose(1) << "Writing temporary non convex hull to file " << NameofTempFile << ".\n";
       tempstream = new ofstream(NameofTempFile.c_str(), ios::trunc);
-      WriteRaster3dFile(out, tempstream, this, cloud);
-      IncludeSphereinRaster3D(out, tempstream, this, cloud);
+      WriteRaster3dFile(tempstream, this, cloud);
+      IncludeSphereinRaster3D(tempstream, this, cloud);
       tempstream->close();
       tempstream->flush();