test/polygon_event_point_test.cpp
// Tests two sets of intervals, where the two sets do not touch in the middle.
Tests two sets of intervals, where the two sets do not touch in the middle.
Tests two sets of intervals where the two sets do not touch in the middle .
TEST(MakeEventPoints, Discontinuity) {
  std::vector<BSPPolygon<AABBConvexPolygon<>>> polygons;
  polygons.push_back(MakeTriangleForInterval(0, Point3(0, 0, 0),
                                             Point3(2, 2, 2)));
  polygons.push_back(MakeTriangleForInterval(0, Point3(1, 1, 1),
                                             Point3(2, 2, 2)));
  polygons.push_back(MakeTriangleForInterval(0, Point3(3, 3, 3),
                                             Point3(5, 5, 5)));
  polygons.push_back(MakeTriangleForInterval(0, Point3(4, 4, 4),
                                             Point3(5, 5, 5)));
  for (size_t dimension = 0; dimension < 3; ++dimension) {
    PolygonEventPoint event_points[8];
    MakeEventPoints(dimension, polygons, event_points);
    CheckSorted(dimension, polygons, event_points);
  }
}
TEST ( MakeEventPoints , Discontinuity ) { std :: vector < BSPPolygon < AABBConvexPolygon < > > > polygons ; polygons . push_back ( MakeTriangleForInterval ( 0 , Point3 ( 0 , 0 , 0 ) , Point3 ( 2 , 2 , 2 ) ) ) ; polygons . push_back ( MakeTriangleForInterval ( 0 , Point3 ( 1 , 1 , 1 ) , Point3 ( 2 , 2 , 2 ) ) ) ; polygons . push_back ( MakeTriangleForInterval ( 0 , Point3 ( 3 , 3 , 3 ) , Point3 ( 5 , 5 , 5 ) ) ) ; polygons . push_back ( MakeTriangleForInterval ( 0 , Point3 ( 4 , 4 , 4 ) , Point3 ( 5 , 5 , 5 ) ) ) ; for ( size_t dimension = 0 ; dimension < 3 ; ++ dimension ) { PolygonEventPoint event_points [ 8 ] ; MakeEventPoints ( dimension , polygons , event_points ) ; CheckSorted ( dimension , polygons , event_points ) ; } }
Tests two sets of intervals, where the two sets do not touch in the middle.
Tests two sets of intervals where the two sets do not touch in the middle .