35 #ifndef treeDataFace_H 36 #define treeDataFace_H 109 scalar& nearestDistSqr,
142 point& intersectionPoint
192 return faceLabels_.
size();
const primitiveMesh & mesh() const
A simple container for copying or transferring objects of type <T>.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
ClassName("treeDataFace")
Encapsulation of data needed to search for faces.
Cell-face mesh analysis engine.
void size(const label)
Override size to be inconsistent with allocated storage.
volumeType getVolumeType(const indexedOctree< treeDataFace > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
pointField shapePoints() const
Get representative point cloud for all shapes inside.
treeDataFace(const bool cacheBb, const primitiveMesh &, const labelUList &)
Construct from mesh and subset of faces.
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.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
Non-pointer based hierarchical recursive searching.
findNearestOp(const indexedOctree< treeDataFace > &tree)
Standard boundBox + extra functionality for use in octree.
A patch is a list of labels that address the faces in the global face list.
const labelList & faceLabels() const