X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FINTERP_KERNEL%2FBBTreePts.txx;h=7beb4b37bafc91e7f44b1a1fcb4075198f6ce54c;hb=19a5d11f2c31745a83bd6993357263641c0babe5;hp=934666e2fdd5ac6f8a1c4e52c674bb615d527a4f;hpb=0511285d155a0682ff6dad10ac916ac53f577476;p=tools%2Fmedcoupling.git

diff --git a/src/INTERP_KERNEL/BBTreePts.txx b/src/INTERP_KERNEL/BBTreePts.txx
index 934666e2f..7beb4b37b 100644
--- a/src/INTERP_KERNEL/BBTreePts.txx
+++ b/src/INTERP_KERNEL/BBTreePts.txx
@@ -1,9 +1,9 @@
-// Copyright (C) 2007-2012  CEA/DEN, EDF R&D
+// Copyright (C) 2007-2016  CEA/DEN, EDF R&D
 //
 // This library is free software; you can redistribute it and/or
 // modify it under the terms of the GNU Lesser General Public
 // License as published by the Free Software Foundation; either
-// version 2.1 of the License.
+// version 2.1 of the License, or (at your option) any later version.
 //
 // This library is distributed in the hope that it will be useful,
 // but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -174,10 +174,12 @@ public:
   }
  
   /*! returns in \a elems the list of elements potentially containing the point pointed to by \a xx
-    \param xx pointer to query point coords
-    \param elems list of elements (given in 0-indexing) intersecting the bounding box
-    \sa BBTreePts::getElementsAroundPoint2
-  */
+   * ** Infinite norm is used here not norm 2 ! ***
+   * 
+   *  \param xx pointer to query point coords
+   *  \param elems list of elements (given in 0-indexing) intersecting the bounding box
+   * \sa BBTreePts::getElementsAroundPoint2
+   */
   void getElementsAroundPoint(const double* xx, std::vector<ConnType>& elems) const
   {
     //  terminal node : return list of elements intersecting bb
@@ -188,8 +190,7 @@ public:
             const double* const bb_ptr=_pts+_elems[i]*dim;
             bool intersects = true;
             for(int idim=0;idim<dim;idim++)
-              if(std::abs(bb_ptr[idim]-xx[idim])>_epsilon)
-                intersects=false;
+              intersects=intersects && (std::abs(bb_ptr[idim]-xx[idim])<=_epsilon);
             if(intersects)
               elems.push_back(_elems[i]);
           }