35 #ifndef triSurfaceSearch_H 36 #define triSurfaceSearch_H 140 return maxTreeDepth_;
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
A list of keyword definitions, which are a keyword followed by any number of values (e...
const triSurface & surface() const
Return reference to the surface.
void findLineAny(const pointField &start, const pointField &end, List< pointIndexHit > &info) const
boolList calcInside(const pointField &searchPoints) const
Calculate for each searchPoint inside/outside status.
const indexedOctree< treeDataTriSurface > & tree() const
Demand driven construction of the octree.
This class describes the interaction of (usually) a face and a point. It carries the info of a succes...
pointIndexHit nearest(const point &, const vector &span) const
Calculate nearest point on surface for single searchPoint. Returns.
label maxTreeDepth() const
Return max tree depth of octree.
void findLineAll(const pointField &start, const pointField &end, List< List< pointIndexHit >> &info) const
Calculate all intersections from start to end.
Helper class to search on triSurface.
scalarField samples(nIntervals, 0)
void findNearest(const pointField &samples, const scalarField &nearestDistSqr, List< pointIndexHit > &info) const
~triSurfaceSearch()
Destructor.
scalar tolerance() const
Return tolerance to use in searches.
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects...
void clearOut()
Clear storage.
Non-pointer based hierarchical recursive searching.
void findLine(const pointField &start, const pointField &end, List< pointIndexHit > &info) const
An auto-pointer similar to the STL auto_ptr but with automatic casting to a reference to the type and...
Triangulated surface description with patch information.