Go to the documentation of this file.
36 #ifndef DistributedDelaunayMesh_H
37 #define DistributedDelaunayMesh_H
43 #include "indexedVertex.H"
56 template<
class Triangulation>
67 typedef typename Triangulation::Finite_vertices_iterator
69 typedef typename Triangulation::Finite_cells_iterator
71 typedef typename Triangulation::All_cells_iterator
96 const scalar radiusSqr
182 bool iterateReferral =
true
188 template<
class Po
intIterator>
193 bool printErrors =
true
~DistributedDelaunayMesh()
Destructor.
void operator=(const DistributedDelaunayMesh< Triangulation > &)
Disallow default bitwise assignment.
Class to control time during OpenFOAM simulations that is also the top-level objectRegistry.
A class for handling words, derived from string.
void findProcessorBoundaryCells(Map< labelList > &circumsphereOverlaps) const
labelList overlapProcessors(const point ¢re, const scalar radiusSqr) const
A HashTable to objects of type <T> with a label key.
DistributedDelaunayMesh(const DistributedDelaunayMesh< Triangulation > &)
Disallow default bitwise copy construct.
A HashTable with keys but without contents.
labelPairHashSet rangeInsertReferredWithInfo(PointIterator begin, PointIterator end, bool printErrors=true)
Inserts points into the triangulation if the point is within.
Triangulation::Finite_cells_iterator Finite_cells_iterator
static autoPtr< mapDistribute > buildMap(const List< label > &toProc)
Build a mapDistribute for the supplied destination processor data.
Triangulation::Cell_handle Cell_handle
void sync(const boundBox &bb)
Refer vertices so that the processor interfaces are consistent.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
label referVertices(const DynamicList< label > &targetProcessor, DynamicList< Vb > ¶llelVertices, PtrList< labelPairHashSet > &referralVertices, labelPairHashSet &receivedVertices)
void markVerticesToRefer(const Map< labelList > &circumsphereOverlaps, PtrList< labelPairHashSet > &referralVertices, DynamicList< label > &targetProcessor, DynamicList< Vb > ¶llelInfluenceVertices)
Triangulation::All_cells_iterator All_cells_iterator
A templated 1D list of pointers to objects of type <T>, where the size of the array is known and used...
scalar calculateLoadUnbalance() const
DelaunayMesh< Triangulation >::labelPairHashSet labelPairHashSet
bool checkProcBoundaryCell(const Cell_handle &cit, Map< labelList > &circumsphereOverlaps) const
Triangulation::Vertex_handle Vertex_handle
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
CellSizeDelaunay ::Cell_handle Cell_handle
bool distribute(const boundBox &bb)
bool isLocal(const Vertex_handle &v) const
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
Triangulation::Finite_vertices_iterator Finite_vertices_iterator
Store a background polyMesh to use for the decomposition of space and queries for parallel conformalV...
A bounding box defined in terms of the points at its extremities.
autoPtr< List< boundBox > > allBackgroundMeshBounds_
The vertex and cell classes must have an index defined.
Triangulation::Point Point
bool distributeBoundBoxes(const boundBox &bb)
CellSizeDelaunay ::Vertex_handle Vertex_handle