trying to guarantee a containing simplex

lib/grid/__init__.py

@@ -54,7 +54,9 @@ class grid(object):
     """
       this returns two grid objects: R and S.
 
-      R is a grid object that is the (a) containing simplex around point X
+      R is a grid object that is supposedly a containing simplex
+        around point X (it tends not to be)
+
       S is S_j from baker's paper : some points from all point that are not the simplex
     """
     (dist, indicies) = self.tree.query(X, simplex_size + extra_points)
@@ -78,6 +80,8 @@ class grid(object):
       points near a short edge in a boundary layer cell where the
       nearest points would all be colinear
 
+      also, it guarantees that we find a containing simplex
+
       R is a grid object that is the (a) containing simplex around point X
       S is a connectivity-based nearest-neighbor lookup, limited to 3 extra points
     """