Templated abstract base-class for demand-driven mesh objects used to automate their allocation to the...
const polyMesh & mesh() const
Non-pointer based hierarchical recursive searching.
Mesh object that implements searches within the local cells and faces.
label findNearestCell(const point &p) const
Find the cell with centre closest to the given point.
label findCell(const point &p, const pointInCellShapes=pointInCellShapes::tets) const
Find the cell containing the given point.
label findNearestFace(const point &p) const
Find the face with centre closest to the given point.
static const meshSearch & New(const polyMesh &mesh, const pointInCellShapes=pointInCellShapes::tets)
Lookup or construct from mesh and cell decomposition option.
meshSearch(const polyMesh &mesh)
Construct from mesh.
void operator=(const meshSearch &)=delete
Disallow default bitwise assignment.
virtual ~meshSearch()
Destructor.
const indexedOctree< treeDataCell > & cellTree() const
Access the cell tree.
TypeName("meshSearch")
Run-time type information.
static label findNearestCellNoTree(const polyMesh &mesh, const point &p)
Find the cell with centre closest to the given point. Do a.
static label findCellNoTree(const polyMesh &mesh, const point &p, const pointInCellShapes=pointInCellShapes::tets)
Find the cell containing the given point. Do a.
Mesh consisting of general polyhedral cells.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
pointInCellShapes
Enumeration for the sub-shapes used to perform the inside calculation.
Function for determining if a point is within a cell of a polyMesh.