if (min<min_right) min_right = min;
}
else
+
{
new_elems_left.push_back(elem);
if (max>max_left) max_left = max;
}
+
}
_max_left=max_left;
_min_right=min_right;
_left=new BBTree(bbs, &(new_elems_left[0]), level+1, new_elems_left.size());
_right=new BBTree(bbs, &(new_elems_right[0]), level+1, new_elems_right.size());
+
}
+
+
~BBTree()
{
if (_left!=0) delete _left;
if (_right!=0) delete _right;
+
}
+
+ /*! returns in \a elems the list of elements potentially intersecting the bounding box pointed to by \a bb
+
+ \param bb pointer to query bounding box
+ \param elems list of elements (given in 0-indexing) intersecting the bounding box
+ */
+
void getIntersectingElems(const double* bb, vector<int>& elems) const
{
// terminal node : return list of elements intersecting bb
_right->getIntersectingElems(bb,elems);
}
+
+
int size()
{
if (_terminal) return _nbelems;
CPPFLAGS+=$(BOOST_CPPFLAGS) $(MED2_INCLUDES) $(HDF5_INCLUDES) -I$(top_srcdir)/src/INTERP_KERNEL
#include CppUnit
-CXXFLAGS+= ${CPPUNIT_INCLUDES}
-CPPFLAGS+= ${CPPUNIT_INCLUDES}
+
+CXXFLAGS+= $(CPPUNIT_INCLUDES)
+CPPFLAGS+= $(CPPUNIT_INCLUDES)
# for log
CXXFLAGS+= -DLOG_LEVEL=3 -DOPTIMIZE -O2 -Wall
class TransformedTriangle
{
+
+
public:
friend class INTERP_TEST::TransformedTriangleTest;
friend class INTERP_TEST::TransformedTriangleIntersectTest;
-
/*
* Enumerations representing the different geometric elements of the unit tetrahedron
* and the triangle. The end element, NO_* gives the number of elements in the enumeration