SBMSurfaceDistanceTest.C File Reference

Go to the source code of this file.

Functions
	TEST (SBMSurfaceDistanceTest, Edge2NormalProjection)
	TEST (SBMSurfaceDistanceTest, Edge2NodeFallback)
	TEST (SBMSurfaceDistanceTest, Edge2TiltedDirection)
	TEST (SBMSurfaceDistanceTest, Tri3NormalProjection)
	TEST (SBMSurfaceDistanceTest, Tri3Tilted)

Function Documentation

TEST() [1/5]

TEST	(	SBMSurfaceDistanceTest	,
		Edge2NodeFallback
	)

Definition at line 39 of file SBMSurfaceDistanceTest.C.

{
  // Edge from (0,0,0) to (1,0,0); query point lies far off the line axis so its
  // projection onto the edge falls outside the segment, forcing the side loop in
  // distanceFrom() to take the NODEELEM/vertex fallback.
  std::unique_ptr<Edge2> edge(new Edge2());
  std::unique_ptr<Node> n0(new Node(Point(0.0, 0.0, 0.0), 0));
  std::unique_ptr<Node> n1(new Node(Point(1.0, 0.0, 0.0), 1));
  edge->set_node(0, n0.get());
  edge->set_node(1, n1.get());
 
  SurfaceEdge2 surface_edge(edge.get());
 
  // Projection of (2, 1, 0) onto the line is (2, 0, 0), outside [0,1]; the
  // nearest entity is node (1, 0, 0).
  Point pt(2.0, 1.0, 0.0);
  Point dist = SBMUtils::distanceFrom(surface_edge, pt);
  EXPECT_NEAR(dist(0), -1.0, 1e-12);
  EXPECT_NEAR(dist(1), -1.0, 1e-12);
  EXPECT_NEAR(dist(2), 0.0, 1e-12);
}

TEST() [2/5]

TEST	(	SBMSurfaceDistanceTest	,
		Edge2NormalProjection
	)

Definition at line 23 of file SBMSurfaceDistanceTest.C.

{
  std::unique_ptr<Edge2> edge(new Edge2());
  std::unique_ptr<Node> n0(new Node(Point(0.0, 0.0, 0.0), 0));
  std::unique_ptr<Node> n1(new Node(Point(1.0, 0.0, 0.0), 1));
  edge->set_node(0, n0.get());
  edge->set_node(1, n1.get());
 
  SurfaceEdge2 surface_edge(edge.get());
 
  // Point directly above the edge midpoint: distance vector is normal-based.
  Point pt(0.5, 1.0, 0.0);
  Point dist = SBMUtils::distanceFrom(surface_edge, pt);
  EXPECT_NEAR(dist(1), -1.0, 1e-12);
}

TEST() [3/5]

TEST	(	SBMSurfaceDistanceTest	,
		Edge2TiltedDirection
	)

Definition at line 61 of file SBMSurfaceDistanceTest.C.

{
  std::unique_ptr<Edge2> edge(new Edge2());
  std::unique_ptr<Node> n0(new Node(Point(0.0, 0.0, 0.0), 0));
  std::unique_ptr<Node> n1(new Node(Point(1.0, 1.0, 0.0), 1));
  edge->set_node(0, n0.get());
  edge->set_node(1, n1.get());
 
  SurfaceEdge2 surface_edge(edge.get());
  const Point n = surface_edge.normal();
 
  Point pt(0.5, 0.0, 0.0);
  Point dist = SBMUtils::distanceFrom(surface_edge, pt);
  // Distance vector should point along the normal direction.
  const double dot = dist(0) * n(0) + dist(1) * n(1);
  EXPECT_GT(dot, 0.0);
  // The nearest point on the edge to (0.5, 0, 0) is its projection (0.25, 0.25, 0), so the
  // distance vector has magnitude 0.25 * sqrt(2). Pinning the magnitude guards against a
  // right-direction-but-wrong-length result.
  EXPECT_NEAR(dist.norm(), 0.25 * std::sqrt(2.0), 1e-12);
}

TEST() [4/5]

TEST	(	SBMSurfaceDistanceTest	,
		Tri3NormalProjection
	)

Definition at line 83 of file SBMSurfaceDistanceTest.C.

{
  std::unique_ptr<Tri3> tri(new Tri3());
  std::unique_ptr<Node> n0(new Node(Point(0.0, 0.0, 0.0), 0));
  std::unique_ptr<Node> n1(new Node(Point(1.0, 0.0, 0.0), 1));
  std::unique_ptr<Node> n2(new Node(Point(0.0, 1.0, 0.0), 2));
  tri->set_node(0, n0.get());
  tri->set_node(1, n1.get());
  tri->set_node(2, n2.get());
 
  SurfaceTri3 surface_tri(tri.get());
 
  // Point above the triangle interior: distance vector roughly in -Z.
  Point pt(0.3, 0.3, 1.0);
  Point dist = SBMUtils::distanceFrom(surface_tri, pt);
  EXPECT_NEAR(dist(2), -1.0, 1e-12);
}

TEST() [5/5]

TEST	(	SBMSurfaceDistanceTest	,
		Tri3Tilted
	)

Definition at line 101 of file SBMSurfaceDistanceTest.C.

{
  std::unique_ptr<Tri3> tri(new Tri3());
  std::unique_ptr<Node> n0(new Node(Point(0.0, 0.0, 0.0), 0));
  std::unique_ptr<Node> n1(new Node(Point(1.0, 0.0, 1.0), 1));
  std::unique_ptr<Node> n2(new Node(Point(0.0, 1.0, 1.0), 2));
  tri->set_node(0, n0.get());
  tri->set_node(1, n1.get());
  tri->set_node(2, n2.get());
 
  SurfaceTri3 surface_tri(tri.get());
 
  // Off-element query: nearest entity is a vertex/edge of the tilted triangle.
  Point pt(2.0, 0.0, 2.0);
  Point dist = SBMUtils::distanceFrom(surface_tri, pt);
  EXPECT_NEAR(dist(0), -1.0, 1e-12);
  EXPECT_NEAR(dist(1), 0.0, 1e-12);
  EXPECT_NEAR(dist(2), -1.0, 1e-12);
 
  // Query exactly on a vertex: zero distance vector.
  Point pt2(0.0, 0.0, 0.0);
  Point dist2 = SBMUtils::distanceFrom(surface_tri, pt2);
  EXPECT_NEAR(dist2(0), 0.0, 1e-12);
  EXPECT_NEAR(dist2(1), 0.0, 1e-12);
  EXPECT_NEAR(dist2(2), 0.0, 1e-12);
}