51 template<
class Type>
class indexedOctree;
79 static bool findNearer
84 scalar& nearestDistSqr
88 static bool findNearer
94 scalar& nearestDistSqr
101 label findNearestCellTree(
const point&)
const;
104 label findNearestCellLinear(
const point&)
const;
120 label findNearestFaceTree(
const point&)
const;
122 label findNearestFaceLinear(
const point&)
const;
132 label findNearestBoundaryFaceWalk
134 const point& location,
135 const label seedFacei
190 return cellDecompMode_;
211 const point& location,
212 const label seedCelli = -1,
213 const bool useTreeSearch =
true 218 const point& location,
219 const label seedFacei = -1,
220 const bool useTreeSearch =
true 229 const point& location,
230 const label seedCelli = -1,
231 const bool useTreeSearch =
true 240 const point& location,
241 const label seedFacei = -1,
242 const bool useTreeSearch =
true polyMesh::cellDecomposition decompMode() const
Various (local, not parallel) searches on polyMesh; uses (demand driven) octree to search...
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
meshSearch(const polyMesh &mesh, const polyMesh::cellDecomposition=polyMesh::CELL_TETS)
Construct from components. Constructs bb slightly bigger than.
const indexedOctree< treeDataCell > & cellTree() const
Get (demand driven) reference to octree holding all cells.
label findNearestCell(const point &location, const label seedCelli=-1, const bool useTreeSearch=true) const
Find nearest cell in terms of cell centre.
void operator=(const meshSearch &)=delete
Disallow default bitwise assignment.
static scalar tol_
Tolerance on linear dimensions.
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...
const polyMesh & mesh() const
cellDecomposition
Enumeration defining the decomposition of the cell for.
void correct()
Correct for mesh geom/topo changes.
label findCell(const point &location, const label seedCelli=-1, const bool useTreeSearch=true) const
Find cell containing location.
const indexedOctree< treeDataFace > & boundaryTree() const
Get (demand driven) reference to octree holding all.
void clearOut()
Delete all storage.
label findNearestBoundaryFace(const point &location, const label seedFacei=-1, const bool useTreeSearch=true) const
Find nearest boundary face.
Non-pointer based hierarchical recursive searching.
Standard boundBox + extra functionality for use in octree.
bool isInside(const point &) const
Determine inside/outside status.
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
Mesh consisting of general polyhedral cells.
List< pointIndexHit > intersections(const point &pStart, const point &pEnd) const
Find all intersections of boundary within segment pStart .. pEnd.
pointIndexHit intersection(const point &pStart, const point &pEnd) const
Find first intersection of boundary in segment [pStart, pEnd].