Go to the documentation of this file.
54 template<
class Type>
class indexedOctree;
83 static bool findNearer
88 scalar& nearestDistSqr
92 static bool findNearer
98 scalar& nearestDistSqr
111 label findNearestCellTree(
const point&)
const;
114 label findNearestCellLinear(
const point&)
const;
118 label findNearestCellWalk(
const point&,
const label)
const;
121 label findCellLinear(
const point&)
const;
125 label findCellWalk(
const point&,
const label)
const;
130 label findNearestFaceTree(
const point&)
const;
132 label findNearestFaceLinear(
const point&)
const;
134 label findNearestFaceWalk(
const point&,
const label)
const;
141 label findNearestBoundaryFaceWalk
143 const point& location,
144 const label seedFacei
203 return cellDecompMode_;
227 const point& location,
228 const label seedCelli = -1,
229 const bool useTreeSearch =
true
234 const point& location,
235 const label seedFacei = -1,
236 const bool useTreeSearch =
true
245 const point& location,
246 const label seedCelli = -1,
247 const bool useTreeSearch =
true
256 const point& location,
257 const label seedFacei = -1,
258 const bool useTreeSearch =
true
cellDecomposition
Enumeration defining the decomposition of the cell for.
const indexedOctree< treeDataFace > & nonCoupledBoundaryTree() const
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.
ClassName("meshSearch")
Declare type-name (with debug switch)
const indexedOctree< treeDataCell > & cellTree() const
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.
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
Demand-driven reference to octree holding all boundary faces.
Minimal example by using system/controlDict.functions:
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.