An intersection with a leaf neighbor elementMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
More...
#include <dune/grid/identitygrid/identitygridintersections.hh>
|
Entity | inside () const |
|
Entity | outside () const |
|
bool | boundary () const |
| return true if intersection is with boundary.
|
|
NormalVector | centerUnitOuterNormal () const |
| Return unit outer normal (length == 1) More...
|
|
bool | neighbor () const |
| return true if across the edge an neighbor on this level exists
|
|
size_t | boundarySegmentIndex () const |
| return the boundary segment index
|
|
bool | conforming () const |
| Return true if this is a conforming intersection.
|
|
GeometryType | type () const |
| Geometry type of an intersection.
|
|
LocalGeometry | geometryInInside () const |
|
LocalGeometry | geometryInOutside () const |
|
Geometry | geometry () const |
|
int | indexInInside () const |
| local number of codim 1 entity in self where intersection is contained in
|
|
int | indexInOutside () const |
| local number of codim 1 entity in neighbor where intersection is contained
|
|
FieldVector< ctype, GridImp::dimensionworld > | outerNormal (const FieldVector< ctype, GridImp::dimension-1 > &local) const |
| return outer normal
|
|
FieldVector< ctype, GridImp::dimensionworld > | integrationOuterNormal (const FieldVector< ctype, GridImp::dimension-1 > &local) const |
| return outer normal multiplied by the integration element
|
|
FieldVector< ctype, GridImp::dimensionworld > | unitOuterNormal (const FieldVector< ctype, GridImp::dimension-1 > &local) const |
| return unit outer normal
|
|
template<class GridImp>
class Dune::IdentityGridLeafIntersection< GridImp >
An intersection with a leaf neighbor element
Mesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element!
◆ centerUnitOuterNormal()
Return unit outer normal (length == 1)
The returned vector is the normal at the center() of the intersection's geometry. It is scaled to have unit length.
◆ geometry()
intersection of codimension 1 of this neighbor with element where iteration started. Here returned element is in GLOBAL coordinates of the element where iteration started.
◆ geometryInInside()
intersection of codimension 1 of this neighbor with element where iteration started. Here returned element is in LOCAL coordinates of the element where iteration started.
◆ geometryInOutside()
intersection of codimension 1 of this neighbor with element where iteration started. Here returned element is in LOCAL coordinates of neighbor
◆ inside()
return Entity on the inside of this intersection (that is the Entity where we started this Iterator)
◆ outside()
return Entity on the outside of this intersection (that is the neighboring Entity)
The documentation for this class was generated from the following file: