// TRI3 test
void testContainsPointTri3()
{
// tri corner nodes
Node a(3,1,2, 0);
Node b(1,2,3, 1);
Node c(2,3,1, 2);
// helper vectors to span the tri and point out of plane
Point va(a-c);
Point vb(b-c);
Point oop(va.cross(vb));
UniquePtr<Elem> elem = Elem::build(TRI3);
elem->set_node(0) = &a;
elem->set_node(1) = &b;
elem->set_node(2) = &c;
// centroid
CPPUNIT_ASSERT (elem->contains_point(elem->centroid()));
// out of plane from the centroid
CPPUNIT_ASSERT (!elem->contains_point(elem->centroid() + oop/10));
// check all corners
CPPUNIT_ASSERT (elem->contains_point(a));
CPPUNIT_ASSERT (elem->contains_point(b));
CPPUNIT_ASSERT (elem->contains_point(c));
// check outside
CPPUNIT_ASSERT (!elem->contains_point(a + va * TOLERANCE * 10));
CPPUNIT_ASSERT (!elem->contains_point(b + vb * TOLERANCE * 10));
CPPUNIT_ASSERT (!elem->contains_point(c - (va + vb) * TOLERANCE * 10));
}
// TET4 test
void testContainsPointTet4()
{
// Construct unit Tet.
{
Node zero (0., 0., 0., 0);
Node one (1., 0., 0., 1);
Node two (0., 1., 0., 2);
Node three (0., 0., 1., 3);
UniquePtr<Elem> elem = Elem::build(TET4);
elem->set_node(0) = &zero;
elem->set_node(1) = &one;
elem->set_node(2) = &two;
elem->set_node(3) = &three;
// The centroid must be inside the element.
CPPUNIT_ASSERT (elem->contains_point(elem->centroid()));
// The vertices must be contained in the element.
CPPUNIT_ASSERT (elem->contains_point(zero));
CPPUNIT_ASSERT (elem->contains_point(one));
CPPUNIT_ASSERT (elem->contains_point(two));
CPPUNIT_ASSERT (elem->contains_point(three));
// Make sure that outside points are not contained.
CPPUNIT_ASSERT (!elem->contains_point(Point(.34, .34, .34)));
CPPUNIT_ASSERT (!elem->contains_point(Point(.33, .33, -.1)));
CPPUNIT_ASSERT (!elem->contains_point(Point(0., -.1, .5)));
}
// Construct a nearly degenerate (sliver) tet. A unit tet with
// nodes "one" and "two" moved to within a distance of epsilon
// from the origin.
{
Real epsilon = 1.e-4;
Node zero (0., 0., 0., 0);
Node one (epsilon, 0., 0., 1);
Node two (0., epsilon, 0., 2);
Node three (0., 0., 1., 3);
UniquePtr<Elem> elem = Elem::build(TET4);
elem->set_node(0) = &zero;
elem->set_node(1) = &one;
elem->set_node(2) = &two;
elem->set_node(3) = &three;
// The centroid must be inside the element.
CPPUNIT_ASSERT (elem->contains_point(elem->centroid()));
// The vertices must be contained in the element.
CPPUNIT_ASSERT (elem->contains_point(zero));
CPPUNIT_ASSERT (elem->contains_point(one));
CPPUNIT_ASSERT (elem->contains_point(two));
CPPUNIT_ASSERT (elem->contains_point(three));
// Verify that a point which is on a mid-edge is contained in the element.
CPPUNIT_ASSERT (elem->contains_point(Point(epsilon/2, 0, 0.5)));
// Make sure that "just barely" outside points are outside.
CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon, epsilon, epsilon/2)));
CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon/10, epsilon/10, 1.0)));
CPPUNIT_ASSERT (!elem->contains_point(Point(epsilon/2, -epsilon/10, 0.5)));
}
}