Container for information needed to couple to meshes. When constructed from two meshes and a geometric tolerance finds the corresponding boundary faces. More...
#include <dynamicMesh/faceCoupleInfo.H>
Container for information needed to couple to meshes. When constructed from two meshes and a geometric tolerance finds the corresponding boundary faces.
The information it keeps is the set of faces&points (cutFaces, cutPoints) that should replace a set of faces on the master (masterPatch) and a set of faces on the slave (slavePatch)
Uses same tolerance to match faces and points on matched faces since they both originate from the same points and the tolerance usually comes from writing these points with limited precision (6 by default)
e.g. master: +--+ | | | | +--+ +--+ | | | | +--+ slave: +--+ | | | | +--+ +--+ | | | | +--+
adding both together creates a singly connected 2x2 cavity so suddenly the duplicate master points and the duplicate slave points all become a single cut point.
Notes on multiple slave faces per master:
As long as
So master: +-------+ | | | | | | | | | | | | | | +-------+ slave: +---+---+ |\ | /| | \ | / | | \|/ | +---+---+ | /|\ | | / | \ | |/ | \| +---+---+ is ok.
For this kind of matching the order is:
Note: matching refined faces onto master is a bit dodgy and will probably only work for unwarped faces. Also it will fail if e.g. face is split into 3x3 since then middle face has no point/edge in common with master. (problem is in face matching (findSlavesCoveringMaster), probably point/edge matching might just work)
Definition at line 158 of file faceCoupleInfo.H.
Public Member Functions | |
ClassName ("faceCoupleInfo") | |
Runtime type information.
| |
faceCoupleInfo (const polyMesh &mesh0, const polyMesh &mesh1, const scalar absTol, const bool perfectMatch) | |
Construct from two meshes and absolute tolerance.
| |
faceCoupleInfo (const polyMesh &masterMesh, const labelList &masterAddressing, const polyMesh &slaveMesh, const labelList &slaveAddressing, const scalar absTol, const bool perfectMatch, const bool orderedFaces, const bool patchDivision) | |
Construct from meshes and subset of mesh faces.
| |
~faceCoupleInfo () | |
const indirectPrimitivePatch & | masterPatch () const |
Addressing engine for coupled faces on mesh0.
| |
const indirectPrimitivePatch & | slavePatch () const |
Addressing engine for coupled faces on mesh1.
| |
const primitiveFacePatch & | cutFaces () const |
Addressing engine for combined set of faces.
| |
const pointField & | cutPoints () const |
Points for combined set of faces.
| |
const labelList & | cutToMasterFaces () const |
Master face for every face on cut. Will always be at least.
| |
const labelList & | masterToCutPoints () const |
const labelList & | cutToSlaveFaces () const |
const labelList & | slaveToCutPoints () const |
const edgeLookup & | cutEdgeToPoints () const |
From two cut points (original edge) to list of inserted.
| |
Static Public Member Functions | |
static labelList | faceLabels (const polyPatch &) |
Utility functions.
| |
static Map< label > | makeMap (const labelList &) |
Create Map from List.
| |
static Map< labelList > | makeMap (const labelListList &) |
faceCoupleInfo | ( | const polyMesh & | mesh0, |
const polyMesh & | mesh1, | ||
const scalar | absTol, | ||
const bool | perfectMatch | ||
) |
Construct from two meshes and absolute tolerance.
Finds out matches geometrically. No checking for nonsense match. Tolerance is absolute one so use with care. perfectMatch : each point/edge/face has corresponding point on other side if this is false then assumes slave is subdivision. Matching then will work only for non-warped faces since does nearest-to-face comparison with absTol.
Definition at line 1912 of file faceCoupleInfo.C.
References polyMesh::faces(), and polyMesh::points().
faceCoupleInfo | ( | const polyMesh & | masterMesh, |
const labelList & | masterAddressing, | ||
const polyMesh & | slaveMesh, | ||
const labelList & | slaveAddressing, | ||
const scalar | absTol, | ||
const bool | perfectMatch, | ||
const bool | orderedFaces, | ||
const bool | patchDivision | ||
) |
Construct from meshes and subset of mesh faces.
(i.e. indirectPrimitivePatch addressing) All faces in patch are considered matched (but don't have to be ordered) perfectMatch : each point/edge/face has corresponding point on other side orderedFaces : faces in patch are ordered (so masterAddressing[i] matches slaveAddressing[i]) patchDivision: faces in slave mesh that originate from the same master face have the same patch. Used by some triangulation methods.
Definition at line 2002 of file faceCoupleInfo.C.
References Foam::abort(), Foam::FatalError, FatalErrorIn, Foam::min(), primitiveMesh::nInternalFaces(), and List< T >::size().
~faceCoupleInfo | ( | ) |
Definition at line 2099 of file faceCoupleInfo.C.
ClassName | ( | "faceCoupleInfo" | ) |
Runtime type information.
Foam::labelList faceLabels | ( | const polyPatch & | pp ) | [static]
|
Utility functions.
Get patch face labels
Definition at line 2105 of file faceCoupleInfo.C.
References forAll, and polyPatch::start().
Definition at line 2119 of file faceCoupleInfo.C.
References forAll, and List< T >::size().
Foam::Map< Foam::labelList > makeMap | ( | const labelListList & | lst ) | [static]
|
Definition at line 2135 of file faceCoupleInfo.C.
References forAll, and List< T >::size().
const indirectPrimitivePatch& masterPatch | ( | ) | const [inline]
|
Addressing engine for coupled faces on mesh0.
Definition at line 443 of file faceCoupleInfo.H.
const indirectPrimitivePatch& slavePatch | ( | ) | const [inline]
|
Addressing engine for coupled faces on mesh1.
Definition at line 449 of file faceCoupleInfo.H.
const primitiveFacePatch& cutFaces | ( | ) | const [inline]
|
Addressing engine for combined set of faces.
Definition at line 455 of file faceCoupleInfo.H.
Referenced by polyMeshAdder::add().
const pointField& cutPoints | ( | ) | const [inline]
|
Points for combined set of faces.
Definition at line 461 of file faceCoupleInfo.H.
const labelList& cutToMasterFaces | ( | ) | const [inline]
|
Master face for every face on cut. Will always be at least.
one but there might be multiple cut faces pointing to the same master
Definition at line 472 of file faceCoupleInfo.H.
const labelList& masterToCutPoints | ( | ) | const [inline]
|
Definition at line 476 of file faceCoupleInfo.H.
const labelList& cutToSlaveFaces | ( | ) | const [inline]
|
Definition at line 481 of file faceCoupleInfo.H.
const labelList& slaveToCutPoints | ( | ) | const [inline]
|
Definition at line 485 of file faceCoupleInfo.H.
const edgeLookup& cutEdgeToPoints | ( | ) | const [inline]
|
From two cut points (original edge) to list of inserted.
points
Definition at line 492 of file faceCoupleInfo.H.