38 #ifndef triSurfaceSearch_H 39 #define triSurfaceSearch_H 144 return maxTreeDepth_;
label maxTreeDepth() const
Return max tree depth of octree.
A list of keyword definitions, which are a keyword followed by a number of values (eg...
scalarField samples(nIntervals, Zero)
This class describes the interaction of an object (often a face) and a point. It carries the info of ...
void findNearest(const pointField &samples, const scalarField &nearestDistSqr, List< pointIndexHit > &info) const
Helper class to search on triSurface.
~triSurfaceSearch()
Destructor.
void findLine(const pointField &start, const pointField &end, List< pointIndexHit > &info) const
boolList calcInside(const pointField &searchPoints) const
Calculate for each searchPoint inside/outside status.
void findLineAll(const pointField &start, const pointField &end, List< List< pointIndexHit >> &info) const
Calculate all intersections from start to end.
void clearOut()
Clear storage.
void findLineAny(const pointField &start, const pointField &end, List< pointIndexHit > &info) const
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
A Vector of values with scalar precision, where scalar is float/double depending on the compilation f...
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
const triSurface & surface() const
Return reference to the surface.
Non-pointer based hierarchical recursive searching.
scalar tolerance() const
Return tolerance to use in searches.
pointIndexHit nearest(const point &pt, const vector &span) const
Calculate nearest point on surface for single searchPoint. Returns.
Pointer management similar to std::unique_ptr, with some additional methods and type checking...
Triangulated surface description with patch information.
const indexedOctree< treeDataTriSurface > & tree() const
Demand driven construction of the octree.