Changes in src/triangleintersectionlist.cpp [bcf653:952f38]

File:

• src/triangleintersectionlist.cpp (modified) (8 diffs)

src/triangleintersectionlist.cpp

@@ -1 @@
-/*
- * Project: MoleCuilder
- * Description: creates and alters molecular systems
- * Copyright (C)  2010 University of Bonn. All rights reserved.
- * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
- */
-
 /*
  * triangleintersectionlist.cpp
@@ -16 +9 @@
  */
 
-// include config.h
-#ifdef HAVE_CONFIG_H
-#include <config.h>
-#endif
-
 #include "Helpers/MemDebug.hpp"
 
@@ -28 +16 @@
 
 #include "Helpers/Info.hpp"
-#include "BoundaryMaps.hpp"
-#include "BoundaryPointSet.hpp"
-#include "BoundaryLineSet.hpp"
-#include "BoundaryTriangleSet.hpp"
 #include "tesselation.hpp"
 #include "LinearAlgebra/Vector.hpp"
@@ -39 +23 @@
  *
  */
-TriangleIntersectionList::TriangleIntersectionList(const Vector &x, const Tesselation *surface, const LinkedCell* LC) :
+TriangleIntersectionList::TriangleIntersectionList(const Vector *x, const Tesselation *surface, const LinkedCell* LC) :
   Point(x),
   Tess(surface),
@@ -86 +70 @@
   }
   // return reference, if none can be found
-  return Point;
+  return *Point;
 };
 
@@ -115 +99 @@
   if (runner != IntersectionList.end()) {
     // if we have found one, check Scalarproduct between the vector
-    Vector TestVector = (Point) - (*(*runner).second);
+    Vector TestVector = (*Point) - (*(*runner).second);
     if (fabs(TestVector.NormSquared()) < MYEPSILON) //
       return true;
@@ -154 +138 @@
     // get intersection with triangle plane
     Intersection = new Vector;
-    (*TriangleRunner)->GetClosestPointInsideTriangle(Point, *Intersection);
-    //Log() << Verbose(1) << "Intersection between " << Point << " and " << **TriangleRunner << " is at " << *Intersection << "." << endl;
+    (*TriangleRunner)->GetClosestPointInsideTriangle(Point, Intersection);
+    //Log() << Verbose(1) << "Intersection between " << *Point << " and " << **TriangleRunner << " is at " << *Intersection << "." << endl;
     IntersectionList.insert( pair<BoundaryTriangleSet *, Vector * > (*TriangleRunner, Intersection) );
   }
@@ -167 +151 @@
   if (DistanceList.empty())
     for (TriangleVectorMap::const_iterator runner = IntersectionList.begin(); runner != IntersectionList.end(); runner++)
-      DistanceList.insert( pair<double, BoundaryTriangleSet *> (Point.distance(*(*runner).second), (*runner).first) );
+      DistanceList.insert( pair<double, BoundaryTriangleSet *> (Point->distance(*(*runner).second), (*runner).first) );
 
   //for (DistanceTriangleMap::const_iterator runner = DistanceList.begin(); runner != DistanceList.end(); runner++)