35 #ifndef treeDataFace_H 36 #define treeDataFace_H 109 scalar& nearestDistSqr,
142 point& intersectionPoint
192 return faceLabels_.
size();
const primitiveMesh & mesh() const
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.
pointField shapePoints() const
Get representative point cloud for all shapes inside.
bool overlaps(const label index, const treeBoundBox &sampleBb) const
Does (bb of) shape at index overlap bb.
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.
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.
volumeType getVolumeType(const indexedOctree< treeDataFace > &, const point &) const
Get type (inside,outside,mixed,unknown) of point w.r.t. surface.
const labelList & faceLabels() const