36 #ifndef treeDataCell_H 37 #define treeDataCell_H 49 template<
class Type>
class indexedOctree;
98 scalar& nearestDistSqr,
129 point& intersectionPoint
188 return cellLabels_.
size();
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
polyMesh::cellDecomposition decompMode() const
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void size(const label)
Override size to be inconsistent with allocated storage.
cellDecomposition
Enumeration defining the decomposition of the cell for.
const polyMesh & mesh() const
volumeType getVolumeType(const indexedOctree< treeDataCell > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
treeDataCell(const bool cacheBb, const polyMesh &, const labelUList &, const polyMesh::cellDecomposition decompMode)
Construct from mesh and subset of cells.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.
Encapsulation of data needed to search in/for cells. Used to find the cell containing a point (e...
pointField shapePoints() const
Get representative point cloud for all shapes inside.
findNearestOp(const indexedOctree< treeDataCell > &tree)
Non-pointer based hierarchical recursive searching.
ClassName("treeDataCell")
Standard boundBox + extra functionality for use in octree.
Mesh consisting of general polyhedral cells.
const labelList & cellLabels() const
#define NotImplemented
Issue a FatalErrorIn for a function not currently implemented.
bool contains(const label index, const point &sample) const
Does shape at index contain sample.