A class for collision detection of two geometries and computation of intersection corners. More...
#include <tuple>#include <dune/common/exceptions.hh>#include <dune/common/promotiontraits.hh>#include <dune/geometry/multilineargeometry.hh>#include <dumux/common/math.hh>#include <dumux/geometry/intersectspointgeometry.hh>#include <dumux/geometry/grahamconvexhull.hh>#include <dumux/geometry/boundingboxtree.hh>Go to the source code of this file.
A class for collision detection of two geometries and computation of intersection corners.
Namespaces | |
| namespace | Dumux |
| namespace | Dumux::IntersectionPolicy |
| namespace | Dumux::Detail |
Typedefs | |
| template<class Geometry1, class Geometry2> | |
| using | Dumux::IntersectionPolicy::DefaultPolicy = typename DefaultPolicyChooser<Geometry1, Geometry2>::type |
| Helper alias to define the default intersection policy. | |
Functions | |
| template<class Geo1, class Geo2, class ctype, class GetFacetCornerIndices, class ComputeNormalFunction> | |
| bool | Dumux::Detail::computeSegmentIntersection (const Geo1 &geo1, const Geo2 &geo2, ctype baseEps, ctype &tfirst, ctype &tlast, const GetFacetCornerIndices &getFacetCornerIndices, const ComputeNormalFunction &computeNormal) |
| Algorithm to find segment-like intersections of a polgon/polyhedron with a segment. The result is stored in the form of the local coordinates tfirst and tlast on the segment geo1. | |