intersectspointsimplex.hh File Reference

Detect if a point intersects a simplex (including boundary) More...

#include <cmath>
#include <dune/common/fvector.hh>
#include <dumux/common/math.hh>

Go to the source code of this file.

Namespaces
namespace	Dumux

Functions
template<class ctype , int dimworld, typename std::enable_if_t<(dimworld==3), int > = 0>
bool	Dumux::intersectsPointSimplex (const Dune::FieldVector< ctype, dimworld > &point, const Dune::FieldVector< ctype, dimworld > &p0, const Dune::FieldVector< ctype, dimworld > &p1, const Dune::FieldVector< ctype, dimworld > &p2, const Dune::FieldVector< ctype, dimworld > &p3)
	Find out whether a point is inside the tetrahedron (p0, p1, p2, p3) (dimworld is 3) More...
template<class ctype , int dimworld, typename std::enable_if_t<(dimworld==3), int > = 0>
bool	Dumux::intersectsPointSimplex (const Dune::FieldVector< ctype, dimworld > &point, const Dune::FieldVector< ctype, dimworld > &p0, const Dune::FieldVector< ctype, dimworld > &p1, const Dune::FieldVector< ctype, dimworld > &p2)
	Find out whether a point is inside the triangle (p0, p1, p2) (dimworld is 3) More...
template<class ctype , int dimworld, typename std::enable_if_t<(dimworld==3||dimworld==2), int > = 0>
bool	Dumux::intersectsPointSimplex (const Dune::FieldVector< ctype, dimworld > &point, const Dune::FieldVector< ctype, dimworld > &p0, const Dune::FieldVector< ctype, dimworld > &p1)
	Find out whether a point is inside the interval (p0, p1) (dimworld is 2 or 3) More...

Include dependency graph for intersectspointsimplex.hh: