Go to the documentation of this file.
38 #ifndef treeDataCell_H
39 #define treeDataCell_H
51 template<
class Type>
class indexedOctree;
100 scalar& nearestDistSqr,
131 point& intersectionPoint
188 inline label
size()
const
190 return cellLabels_.size();
cellDecomposition
Enumeration defining the decomposition of the cell for.
pointField shapePoints() const
Get representative point cloud for all shapes inside.
Standard boundBox with extra functionality for use in octree.
findNearestOp(const indexedOctree< treeDataCell > &tree)
const polyMesh & mesh() const
Mesh consisting of general polyhedral cells.
volumeType getVolumeType(const indexedOctree< treeDataCell > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
#define NotImplemented
Issue a FatalErrorIn for a function not currently implemented.
Encapsulation of data needed to search in/for cells. Used to find the cell containing a point (e....
An enumeration wrapper for classification of a location as being inside/outside of a volume.
const labelList & cellLabels() const
Non-pointer based hierarchical recursive searching.
polyMesh::cellDecomposition decompMode() const
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
ClassName("treeDataCell")
treeDataCell(const bool cacheBb, const polyMesh &mesh, const labelUList &cellLabels, const polyMesh::cellDecomposition decompMode)
Construct from mesh, copying subset of cells.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
bool contains(const label index, const point &sample) const
Does shape at index contain sample.
bool ln(const fileName &src, const fileName &dst)
Create a softlink. dst should not exist. Returns true if successful.
findIntersectOp(const indexedOctree< treeDataCell > &tree)
Minimal example by using system/controlDict.functions: