dune-grid-glue 2.10
|
Common base class for many merger implementations: produce pairs of entities that may intersect. More...
#include <dune/grid-glue/merging/standardmerge.hh>
Public Types | |
typedef T | ctype |
the numeric type used in this interface | |
using | Grid1Coords = typename Base::Grid1Coords |
Type used for local coordinates on the grid1 side. | |
using | Grid2Coords = typename Base::Grid2Coords |
Type used for local coordinates on the grid2 side. | |
using | WorldCoords = typename Base::WorldCoords |
the coordinate type used in this interface | |
using | IntersectionList = typename Base::IntersectionList |
Public Member Functions | |
void | build (const std::vector< Dune::FieldVector< T, dimworld > > &grid1_Coords, const std::vector< unsigned int > &grid1_elements, const std::vector< Dune::GeometryType > &grid1_element_types, const std::vector< Dune::FieldVector< T, dimworld > > &grid2_coords, const std::vector< unsigned int > &grid2_elements, const std::vector< Dune::GeometryType > &grid2_element_types) override |
void | clear () override |
std::shared_ptr< IntersectionList > | intersectionList () const final |
void | enableFallback (bool fallback) |
void | enableBruteForce (bool bruteForce) |
unsigned int | nSimplices () const |
get the number of simplices in the merged grid The indices are then in 0..nSimplices()-1 | |
unsigned int | parents (unsigned int idx) const |
unsigned int | parent (unsigned int idx, unsigned int parId=0) const |
get index of grid-n's parent simplex for given merged grid simplex | |
auto | parentLocal (unsigned int idx, unsigned int corner, unsigned int parId=0) const |
get the grid-n parent's simplex local coordinates for a particular merged grid simplex corner (parent's index can be obtained via "parent<n>") | |
Public Attributes | |
unsigned int | counter |
Counts the number of times the computeIntersection method has been called. | |
Protected Types | |
using | IntersectionListProvider = SimplicialIntersectionListProvider< grid1Dim, grid2Dim > |
The computed intersections. | |
using | SimplicialIntersection = typename IntersectionListProvider::SimplicialIntersection |
using | RemoteSimplicialIntersection = SimplicialIntersection |
Protected Member Functions | |
StandardMerge () | |
virtual | ~StandardMerge ()=default |
virtual void | computeIntersections (const Dune::GeometryType &grid1ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid1ElementCorners, std::bitset<(1<< grid1Dim)> &neighborIntersects1, unsigned int grid1Index, const Dune::GeometryType &grid2ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid2ElementCorners, std::bitset<(1<< grid2Dim)> &neighborIntersects2, unsigned int grid2Index, std::vector< SimplicialIntersection > &intersections)=0 |
Compute the intersection between two overlapping elements. | |
bool | computeIntersection (unsigned int candidate0, unsigned int candidate1, const std::vector< Dune::FieldVector< T, dimworld > > &grid1Coords, const std::vector< Dune::GeometryType > &grid1_element_types, std::bitset<(1<< grid1Dim)> &neighborIntersects1, const std::vector< Dune::FieldVector< T, dimworld > > &grid2Coords, const std::vector< Dune::GeometryType > &grid2_element_types, std::bitset<(1<< grid2Dim)> &neighborIntersects2, bool insert=true) |
Compute the intersection between two overlapping elements. | |
Protected Attributes | |
bool | valid = false |
std::shared_ptr< IntersectionListProvider > | intersectionListProvider_ |
std::shared_ptr< IntersectionList > | intersectionList_ |
std::vector< std::vector< unsigned int > > | grid1ElementCorners_ |
Temporary internal data. | |
std::vector< std::vector< unsigned int > > | grid2ElementCorners_ |
std::vector< std::vector< int > > | elementNeighbors1_ |
std::vector< std::vector< int > > | elementNeighbors2_ |
Common base class for many merger implementations: produce pairs of entities that may intersect.
Many merger algorithms consist of two parts: on the one hand there is a mechanism that produces pairs of elements that may intersect. On the other hand there is an algorithm that computes the intersection of two given elements. For the pairs-producing algorithm there appears to be a canonical choice, namely the algorithm by Gander and Japhet described in 'An Algorithm for Non-Matching Grid Projections with Linear Complexity, M.J. Gander and C. Japhet, Domain Decomposition Methods in Science and Engineering XVIII, pp. 185–192, Springer-Verlag, 2009.' This class implements this algorithm, calling a pure virtual function computeIntersection() to compute the intersection between two elements. Actual merger implementations can derive from this class and only implement computeIntersection().
T | The type used for coordinates (assumed to be the same for both grids) |
grid1Dim | Dimension of the grid1 grid |
grid2Dim | Dimension of the grid2 grid |
dimworld | Dimension of the world space where the coupling takes place |
typedef T Dune::GridGlue::StandardMerge< T, grid1Dim, grid2Dim, dimworld >::ctype |
the numeric type used in this interface
using Dune::GridGlue::StandardMerge< T, grid1Dim, grid2Dim, dimworld >::Grid1Coords = typename Base::Grid1Coords |
Type used for local coordinates on the grid1 side.
using Dune::GridGlue::StandardMerge< T, grid1Dim, grid2Dim, dimworld >::Grid2Coords = typename Base::Grid2Coords |
Type used for local coordinates on the grid2 side.
using Dune::GridGlue::StandardMerge< T, grid1Dim, grid2Dim, dimworld >::IntersectionList = typename Base::IntersectionList |
|
protected |
The computed intersections.
|
protected |
|
protected |
using Dune::GridGlue::StandardMerge< T, grid1Dim, grid2Dim, dimworld >::WorldCoords = typename Base::WorldCoords |
the coordinate type used in this interface
|
inlineprotected |
|
protectedvirtualdefault |
|
overridevirtual |
|
inlineoverridevirtual |
|
protected |
Compute the intersection between two overlapping elements.
|
protectedpure virtual |
Compute the intersection between two overlapping elements.
The result is a set of simplices stored in the vector intersections.
|
inline |
|
inline |
|
inlinefinalvirtual |
list of intersections
build()
was called Implements Dune::GridGlue::Merger< T, grid1Dim, grid2Dim, dimworld >.
|
inlineinherited |
get the number of simplices in the merged grid The indices are then in 0..nSimplices()-1
|
inlineinherited |
get index of grid-n's parent simplex for given merged grid simplex
n | specify which grid |
idx | index of the merged grid simplex |
|
inlineinherited |
get the grid-n parent's simplex local coordinates for a particular merged grid simplex corner (parent's index can be obtained via "parent<n>")
n | specify which grid |
idx | the index of the merged grid simplex |
corner | the index of the simplex' corner |
|
inlineinherited |
doc me
|
inherited |
Counts the number of times the computeIntersection method has been called.
Used temporarily to speed up the implementation
|
protected |
|
protected |
|
protected |
Temporary internal data.
|
protected |
|
protected |
|
protected |
|
protected |