From 7e8f992de5fb8450aeec7f91495c66ae6a183cec Mon Sep 17 00:00:00 2001
From: Timo Koch <timo.koch@iws.uni-stuttgart.de>
Date: Wed, 24 Jan 2018 17:57:21 +0100
Subject: [PATCH] [test][geometry] Add test for 2d3d intersections
---
dumux/common/geometry/geometryintersection.hh | 2 +
test/common/geometry/CMakeLists.txt | 2 +
.../common/geometry/test_2d3d_intersection.cc | 133 ++++++++++++++++++
3 files changed, 137 insertions(+)
create mode 100644 test/common/geometry/test_2d3d_intersection.cc
diff --git a/dumux/common/geometry/geometryintersection.hh b/dumux/common/geometry/geometryintersection.hh
index 5e3afd3b41..43e3b0605c 100644
--- a/dumux/common/geometry/geometryintersection.hh
+++ b/dumux/common/geometry/geometryintersection.hh
@@ -293,6 +293,7 @@ public:
const auto eps = (geo1.corner(0) - geo1.corner(1)).two_norm()*eps_;
std::sort(points.begin(), points.end(), [&eps](const auto& a, const auto& b) -> bool
{
+ using std::abs;
return (abs(a[0]-b[0]) > eps ? a[0] < b[0] : (abs(a[1]-b[1]) > eps ? a[1] < b[1] : (a[2] < b[2])));
});
@@ -308,6 +309,7 @@ public:
// compute convex hull
const auto convexHull = grahamConvexHull2d3d(points);
+ assert(!convexHull.empty());
// the intersections are the triangulation of the convex hull polygon
intersection = triangulateConvexHull(convexHull);
diff --git a/test/common/geometry/CMakeLists.txt b/test/common/geometry/CMakeLists.txt
index 2d10a00d2e..c127993f4d 100644
--- a/test/common/geometry/CMakeLists.txt
+++ b/test/common/geometry/CMakeLists.txt
@@ -1,9 +1,11 @@
dune_add_test(SOURCES test_1d3d_intersection.cc)
+dune_add_test(SOURCES test_2d3d_intersection.cc)
dune_add_test(SOURCES test_graham_convex_hull.cc)
#install sources
install(FILES
test_1d3d_intersection.cc
+test_2d3d_intersection.cc
test_graham_convex_hull.cc
writetriangulation.hh
DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}/dumux/test/common/geometry)
diff --git a/test/common/geometry/test_2d3d_intersection.cc b/test/common/geometry/test_2d3d_intersection.cc
new file mode 100644
index 0000000000..5a697fec32
--- /dev/null
+++ b/test/common/geometry/test_2d3d_intersection.cc
@@ -0,0 +1,133 @@
+// graham convex hull test + triangulation
+#include <config.h>
+
+#include <fstream>
+#include <iostream>
+#include <string>
+
+#include <dune/common/exceptions.hh>
+#include <dune/common/fvector.hh>
+#include <dune/common/timer.hh>
+#include <dune/geometry/multilineargeometry.hh>
+
+#include <dumux/common/geometry/geometryintersection.hh>
+#include <test/common/geometry/writetriangulation.hh>
+
+template<int dimworld = 3>
+void testSegTriangle(const Dune::FieldVector<double, dimworld>& a,
+ const Dune::FieldVector<double, dimworld>& b,
+ const Dune::FieldVector<double, dimworld>& c,
+ const Dune::FieldVector<double, dimworld>& q,
+ const Dune::FieldVector<double, dimworld>& p,
+ bool expectIntersection = true)
+{
+ using TriGeometry = Dune::MultiLinearGeometry<double, 2, dimworld>;
+ using SegGeometry = Dune::MultiLinearGeometry<double, 1, dimworld>;
+ using Test = Dumux::GeometryIntersection<TriGeometry, SegGeometry>;
+ typename Test::IntersectionType intersection;
+
+ if (Test::template intersection<2>(a, b, c, p, q, intersection))
+ {
+ if (intersection.size() != 1)
+ DUNE_THROW(Dune::InvalidStateException, "Found more than one intersection poin!");
+
+ if (expectIntersection)
+ std::cout << "Found intersection point: " << intersection[0] << std::endl;
+ else
+ DUNE_THROW(Dune::InvalidStateException, "Found false positive: " << intersection[0]);
+ }
+ else
+ {
+ if (expectIntersection)
+ DUNE_THROW(Dune::InvalidStateException, "No intersection found!");
+ else
+ std::cout << "No intersection point (as expected). " << std::endl;
+ }
+}
+
+int main(int argc, char* argv[]) try
+{
+ constexpr int dimworld = 3;
+ using Point = Dune::FieldVector<double, dimworld>;
+
+ Point a{0.0, 0.0, 0.1};
+ Point b{1.0, 0.0, 0.0};
+ Point c{0.0, 1.0, 0.0};
+
+ Point p0{0.5, 0.5, -1.0};
+ Point q0{0.5, 0.5, 1.0};
+
+ testSegTriangle(a, b, c, p0, q0);
+ testSegTriangle(a, b, c, q0, p0);
+
+ Point p1 = a;
+ Point q1 = b;
+
+ testSegTriangle(a, b, c, p1, q1, false);
+ testSegTriangle(a, b, c, q1, p1, false);
+
+ Point p2{0.0, 0.0, 0.0};
+ Point q2{0.0, 0.0, 0.2};
+
+ testSegTriangle(a, b, c, p2, q2);
+
+ using Geometry3D = Dune::MultiLinearGeometry<double, 3, dimworld>;
+ using Geometry2D = Dune::MultiLinearGeometry<double, 2, dimworld>;
+ using Test = Dumux::GeometryIntersection<Geometry3D, Geometry2D>;
+ typename Test::IntersectionType intersections;
+
+ std::vector<Dune::FieldVector<double, dimworld>> cubeCorners({
+ {0.0, 0.0, 0.0}, {1.0, 0.0, 0.0}, {0.0, 1.0, 0.0}, {1.0, 1.0, 0.0},
+ {0.0, 0.0, 1.0}, {1.0, 0.0, 1.0}, {0.0, 1.0, 1.0}, {1.0, 1.0, 1.0}
+ });
+
+ std::vector<Dune::FieldVector<double, dimworld>> quadCorners({
+ {0.0, 0.0, 0.5}, {1.0, 0.0, 0.5}, {0.0, 1.0, 0.5}, {1.0, 1.0, 0.5}
+ });
+
+ std::vector<Dune::FieldVector<double, dimworld>> triCorners({
+ {-0.1, -0.1, 0.3}, {1.1, -0.1, 0.3}, {0.5, 2.0, 0.8}
+ });
+
+#if DUNE_VERSION_NEWER(DUNE_COMMON,2,6)
+ Geometry3D cube(Dune::GeometryTypes::cube(dimworld), cubeCorners);
+ Geometry2D quad(Dune::GeometryTypes::cube(dimworld-1), quadCorners);
+ Geometry2D tri(Dune::GeometryTypes::simplex(dimworld-1), triCorners);
+#else
+ Dune::GeometryType geomType; geomType.makeCube(dimworld);
+ Dune::GeometryType geomType2; geomType2.makeCube(dimworld-1);
+ Dune::GeometryType geomType3; geomType3.makeSimplex(dimworld-1);
+ Geometry3D cube(geomType, cubeCorners);
+ Geometry2D quad(geomType2, quadCorners);
+ Geometry2D tri(geomType3, triCorners);
+#endif
+
+ if (Test::intersection(cube, quad, intersections))
+ {
+ Dumux::writeVTKPolyDataTriangle(intersections, "quad_intersections");
+ if (intersections.size() != 4)
+ DUNE_THROW(Dune::InvalidStateException, "Should be 4 intersections!");
+ }
+ else
+ DUNE_THROW(Dune::InvalidStateException, "No intersections found!");
+
+ if (Test::intersection(cube, tri, intersections))
+ {
+ Dumux::writeVTKPolyDataTriangle(intersections, "tri_intersections");
+ if (intersections.size() != 6)
+ DUNE_THROW(Dune::InvalidStateException, "Should be 4 intersections!");
+ }
+ else
+ DUNE_THROW(Dune::InvalidStateException, "No intersections found!");
+
+ std::cout << "All tests passed!" << std::endl;
+
+ return 0;
+}
+// //////////////////////////////////
+// Error handler
+// /////////////////////////////////
+catch (const Dune::Exception& e) {
+ std::cout << e << std::endl;
+ return 1;
+}
--
GitLab