 |
3.1-git
DUNE for Multi-{Phase, Component, Scale, Physics, ...} flow and transport in porous media
|
| |
3.1-git
DUNE for Multi-{Phase, Component, Scale, Physics, ...} flow and transport in porous media
|
Algorithms that finds which geometric entites intersect. More...
#include <cmath>#include <type_traits>#include <dune/common/fvector.hh>#include <dumux/common/math.hh>#include <dumux/common/geometry/boundingboxtree.hh>#include <dumux/common/geometry/intersectspointgeometry.hh>#include <dumux/common/geometry/geometryintersection.hh>#include <dumux/common/geometry/boundingboxtreeintersection.hh>#include <dumux/common/geometry/triangulation.hh>Go to the source code of this file.
Algorithms that finds which geometric entites intersect.
Namespaces | |
| namespace | Dumux |
| make the local view function available whenever we use the grid geometry | |
Functions | |
| template<class EntitySet , class ctype , int dimworld> | |
| std::vector< std::size_t > | Dumux::intersectingEntities (const Dune::FieldVector< ctype, dimworld > &point, const BoundingBoxTree< EntitySet > &tree, bool isCartesianGrid=false) |
| Compute all intersections between entities and a point. More... | |
| template<class EntitySet , class ctype , int dimworld> | |
| void | Dumux::intersectingEntities (const Dune::FieldVector< ctype, dimworld > &point, const BoundingBoxTree< EntitySet > &tree, std::size_t node, std::vector< std::size_t > &entities, bool isCartesianGrid=false) |
| Compute intersections with point for all nodes of the bounding box tree recursively. More... | |
| template<class EntitySet0 , class EntitySet1 > | |
| std::vector< BoundingBoxTreeIntersection< EntitySet0, EntitySet1 > > | Dumux::intersectingEntities (const BoundingBoxTree< EntitySet0 > &treeA, const BoundingBoxTree< EntitySet1 > &treeB) |
| Compute all intersections between two bounding box trees. More... | |
| template<class EntitySet0 , class EntitySet1 > | |
| void | Dumux::intersectingEntities (const BoundingBoxTree< EntitySet0 > &treeA, const BoundingBoxTree< EntitySet1 > &treeB, std::size_t nodeA, std::size_t nodeB, std::vector< BoundingBoxTreeIntersection< EntitySet0, EntitySet1 > > &intersections) |
| Compute all intersections between two all bounding box tree nodes recursively. More... | |
1.9.3