Go to the documentation of this file.
54 template<
class Type>
class indexedOctree;
82 static bool findNearer
87 scalar& nearestDistSqr
91 static bool findNearer
97 scalar& nearestDistSqr
104 label findNearestCellTree(
const point&)
const;
107 label findNearestCellLinear(
const point&)
const;
123 label findNearestFaceTree(
const point&)
const;
125 label findNearestFaceLinear(
const point&)
const;
135 label findNearestBoundaryFaceWalk
137 const point& location,
138 const label seedFacei
196 return cellDecompMode_;
217 const point& location,
218 const label seedCelli = -1,
219 const bool useTreeSearch =
true
224 const point& location,
225 const label seedFacei = -1,
226 const bool useTreeSearch =
true
235 const point& location,
236 const label seedCelli = -1,
237 const bool useTreeSearch =
true
246 const point& location,
247 const label seedFacei = -1,
248 const bool useTreeSearch =
true
cellDecomposition
Enumeration defining the decomposition of the cell for.
Various (local, not parallel) searches on polyMesh; uses (demand driven) octree to search.
Standard boundBox with extra functionality for use in octree.
label findCell(const point &location, const label seedCelli=-1, const bool useTreeSearch=true) const
Find cell containing location.
List< pointIndexHit > intersections(const point &pStart, const point &pEnd) const
Find all intersections of boundary within segment pStart .. pEnd.
Mesh consisting of general polyhedral cells.
const indexedOctree< treeDataCell > & cellTree() const
Get (demand driven) reference to octree holding all cells.
polyMesh::cellDecomposition decompMode() const
label findNearestFace(const point &location, const label seedFacei=-1, const bool useTreeSearch=true) const
This class describes the interaction of (usually) a face and a point. It carries the info of a succes...
void clearOut()
Delete all storage.
void correct()
Correct for mesh geom/topo changes.
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 findNearestBoundaryFace(const point &location, const label seedFacei=-1, const bool useTreeSearch=true) const
Find nearest boundary face.
Non-pointer based hierarchical recursive searching.
bool isInside(const point &) const
Determine inside/outside status.
Pointer management similar to std::unique_ptr, with some additional methods and type checking.
const polyMesh & mesh() const
pointIndexHit intersection(const point &pStart, const point &pEnd) const
Find first intersection of boundary in segment [pStart, pEnd].
const indexedOctree< treeDataFace > & boundaryTree() const
Get (demand driven) reference to octree holding all.
label findNearestCell(const point &location, const label seedCelli=-1, const bool useTreeSearch=true) const
Find nearest cell in terms of cell centre.
static scalar tol_
Tolerance on linear dimensions.