geometryintersection.hh File Reference

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 <dune/geometry/referenceelements.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.

Description

A class for collision detection of two geometries and computation of intersection corners.

Classes
struct	Dumux::IntersectionPolicy::PointPolicy< ct, dw >
	Policy structure for point-like intersections. More...
struct	Dumux::IntersectionPolicy::SegmentPolicy< ct, dw >
	Policy structure for segment-like intersections. More...
struct	Dumux::IntersectionPolicy::PolygonPolicy< ct, dw >
	Policy structure for polygon-like intersections. More...
struct	Dumux::IntersectionPolicy::PolyhedronPolicy< ct, dw >
	Policy structure for polyhedron-like intersections. More...
class	Dumux::IntersectionPolicy::DefaultPolicyChooser< Geometry1, Geometry2 >
	default policy chooser class More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, dimworld, dim1, dim2 >
	A class for geometry collision detection and intersection calculation The class can be specialized for combinations of dimworld, dim1, dim2, where dimworld is the world dimension embedding a grid of dim1 and a grid of dim2. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 2, 1, 1 >
	A class for segment–segment intersection in 2d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 2, 2, 1 >
	A class for polygon–segment intersection in 2d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 2, 1, 2 >
	A class for segment–polygon intersection in 2d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 2, 2, 2 >
	A class for polygon–polygon intersection in 2d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 3, 1 >
	A class for polyhedron–segment intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 1, 3 >
	A class for segment–polyhedron intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 2, 2 >
	A class for polygon–polygon intersections in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 3, 2 >
	A class for polyhedron–polygon intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 2, 3 >
	A class for polygon–polyhedron intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 3, 3 >
	A class for polyhedron–polyhedron intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 2, 1 >
	A class for polygon–segment intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 1, 2 >
	A class for segment–polygon intersection in 3d space. More...
class	Dumux::GeometryIntersection< Geometry1, Geometry2, Policy, 3, 1, 1 >
	A class for segment–segment intersection in 3d space. More...

Namespaces
namespace	Dumux
	Adaption of the non-isothermal two-phase two-component flow model to problems with CO2.
namespace	Dumux::IntersectionPolicy
namespace	Dumux::Detail
	Distance implementation details.

Typedefs
template<class Geometry1 , class Geometry2 >
using	Dumux::IntersectionPolicy::DefaultPolicy = typename DefaultPolicyChooser< Geometry1, Geometry2 >::type
	Helper alias to define the default intersection policy. More...

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 polygon/polyhedron with a segment. The result is stored in the form of the local coordinates tfirst and tlast on the segment geo1. More...

Include dependency graph for geometryintersection.hh: