Changeset 342fbc9 for molecuilder/src

Timestamp:

Apr 20, 2010, 9:21:51 AM (15 years ago)

Author:

Frederik Heber <heber@…>

Children:

086db0

Parents:

adff53

Message:

BUGFIXES: LinkedCell::SetIndexToNode() had wrong boundaries in zero case, LinkedCell::GetPointsInsideSphere() took only half the right radius

• BUGFIX: LinkedCell::SetIndexToNode() - upper and lower were set to 0 instead of n[i] when step=0 only worked
• BUGFIX: LinkedCell::GetPointsInsideSphere() called GetallNeighbours() with RADIUS instead if 2.*RADIUS

File:

• molecuilder/src/linkedcell.cpp (modified) (4 diffs)

molecuilder/src/linkedcell.cpp

@@ -280 +280 @@
  * \param *lower lower bounds
  * \param *upper upper bounds
+ * \param step how deep to check the neighbouring cells (i.e. number of layers to check)
  */
 void LinkedCell::GetNeighbourBounds(int lower[NDIM], int upper[NDIM], int step) const
 {
   for (int i=0;i<NDIM;i++) {
-    lower[i] = 0;
+    lower[i] = n[i];
     for (int s=step; s>0;--s)
       if ((n[i]-s) >= 0) {
@@ -290 +291 @@
         break;
       }
-    upper[i] = 0;
+    upper[i] = n[i];
     for (int s=step; s>0;--s)
       if ((n[i]+s) < N[i]) {
@@ -296 +297 @@
         break;
       }
-    //Log() << Verbose(0) << " [" << lower[i] << "," << upper[i] << "] ";
-    // check for this axis whether the point is outside of our grid
-    if (n[i] < 0)
-      upper[i] = lower[i];
-    if (n[i] > N[i])
-      lower[i] = upper[i];
-
     //Log() << Verbose(0) << "axis " << i << " has bounds [" << lower[i] << "," << upper[i] << "]" << endl;
   }
@@ -401 +395 @@
   // set index of LC to center of sphere
   const double dist = SetClosestIndexToOutsideVector(center);
-  if (dist > radius) {
+  if (dist > 2.*radius) {
     DoeLog(1) && (eLog()<< Verbose(1) << "Vector " << *center << " is too far away from any atom in LinkedCell's bounding box." << endl);
     return TesselList;
-  }
+  } else
+    Log() << Verbose(1) << "Distance of closest cell to center of sphere with radius " << radius << " is " << dist << "." << endl;
 
   // gather all neighbours first, then look who fulfills distance criteria
-  NeighbourList = GetallNeighbours(radius-dist);
+  NeighbourList = GetallNeighbours(2.*radius-dist);
+  //Log() << Verbose(1) << "I found " << NeighbourList->size() << " neighbours to check." << endl;
   if (NeighbourList != NULL) {
     for (LinkedNodes::const_iterator Runner = NeighbourList->begin(); Runner != NeighbourList->end(); Runner++) {
       Walker = *Runner;
+      //Log() << Verbose(1) << "Current neighbour is at " << *Walker->node << "." << endl;
       if ((center->DistanceSquared(Walker->node) - radiusSquared) < MYEPSILON) {
         TesselList->push_back(Walker);