Public Member Functions | List of all members
triSurfaceSearch Class Reference

Helper class to search on triSurface. More...

Inheritance diagram for triSurfaceSearch:
Inheritance graph
[legend]

Public Member Functions

 triSurfaceSearch (const triSurface &)
 Construct from surface. Holds reference to surface! More...
 
 triSurfaceSearch (const triSurface &, const dictionary &dict)
 Construct from surface and dictionary. More...
 
 triSurfaceSearch (const triSurface &surface, const scalar tolerance, const label maxTreeDepth)
 Construct from components. More...
 
 triSurfaceSearch (const triSurfaceSearch &)=delete
 Disallow default bitwise copy construction. More...
 
 ~triSurfaceSearch ()
 Destructor. More...
 
void clearOut ()
 Clear storage. More...
 
const indexedOctree< treeDataTriSurface > & tree () const
 Demand driven construction of the octree. More...
 
const triSurface & surface () const
 Return reference to the surface. More...
 
scalar tolerance () const
 Return tolerance to use in searches. More...
 
label maxTreeDepth () const
 Return max tree depth of octree. More...
 
boolList calcInside (const pointField &searchPoints) const
 Calculate for each searchPoint inside/outside status. More...
 
void findNearest (const pointField &samples, const scalarField &nearestDistSqr, List< pointIndexHit > &info) const
 
pointIndexHit nearest (const point &, const vector &span) const
 Calculate nearest point on surface for single searchPoint. Returns. More...
 
void findLine (const pointField &start, const pointField &end, List< pointIndexHit > &info) const
 
void findLineAny (const pointField &start, const pointField &end, List< pointIndexHit > &info) const
 
void findLineAll (const pointField &start, const pointField &end, List< List< pointIndexHit >> &info) const
 Calculate all intersections from start to end. More...
 
void operator= (const triSurfaceSearch &)=delete
 Disallow default bitwise assignment. More...
 

Detailed Description

Helper class to search on triSurface.

Source files

Definition at line 55 of file triSurfaceSearch.H.

Constructor & Destructor Documentation

◆ triSurfaceSearch() [1/4]

triSurfaceSearch ( const triSurface &  surface)
explicit

Construct from surface. Holds reference to surface!

Definition at line 133 of file triSurfaceSearch.C.

◆ triSurfaceSearch() [2/4]

triSurfaceSearch ( const triSurface &  surface,
const dictionary &  dict 
)

Construct from surface and dictionary.

Definition at line 142 of file triSurfaceSearch.C.

References dict, Foam::endl(), and Foam::Info.

Here is the call graph for this function:

◆ triSurfaceSearch() [3/4]

triSurfaceSearch ( const triSurface &  surface,
const scalar  tolerance,
const label  maxTreeDepth 
)

Construct from components.

Definition at line 167 of file triSurfaceSearch.C.

◆ triSurfaceSearch() [4/4]

triSurfaceSearch ( const triSurfaceSearch &  )
delete

Disallow default bitwise copy construction.

◆ ~triSurfaceSearch()

~triSurfaceSearch ( )

Destructor.

Definition at line 183 of file triSurfaceSearch.C.

Member Function Documentation

◆ clearOut()

void clearOut ( )

Clear storage.

Definition at line 189 of file triSurfaceSearch.C.

Referenced by triSurfaceRegionSearch::clearOut().

Here is the caller graph for this function:

◆ tree()

const Foam::indexedOctree< Foam::treeDataTriSurface > & tree ( ) const

Demand driven construction of the octree.

Definition at line 198 of file triSurfaceSearch.C.

References PatchTools::calcBounds(), Foam::e, Foam::endl(), treeBoundBox::extend(), nPoints, indexedOctree< Type >::perturbTol(), points, WarningInFunction, and Foam::Zero.

Here is the call graph for this function:

◆ surface()

const triSurface& surface ( ) const
inline

Return reference to the surface.

Definition at line 122 of file triSurfaceSearch.H.

Referenced by edgeIntersections::edgeIntersections(), edgeIntersections::removeDegenerates(), and surfaceIntersection::surfaceIntersection().

Here is the caller graph for this function:

◆ tolerance()

scalar tolerance ( ) const
inline

Return tolerance to use in searches.

Definition at line 128 of file triSurfaceSearch.H.

Referenced by searchableSurfaces::checkIntersection().

Here is the caller graph for this function:

◆ maxTreeDepth()

label maxTreeDepth ( ) const
inline

Return max tree depth of octree.

Definition at line 134 of file triSurfaceSearch.H.

◆ calcInside()

Foam::boolList calcInside ( const pointField &  searchPoints) const

Calculate for each searchPoint inside/outside status.

Definition at line 248 of file triSurfaceSearch.C.

References forAll, volumeType::inside, samples(), and List< T >::size().

Here is the call graph for this function:

◆ findNearest()

void findNearest ( const pointField &  samples,
const scalarField &  nearestDistSqr,
List< pointIndexHit > &  info 
) const

Definition at line 276 of file triSurfaceSearch.C.

References forAll, indexedOctree< Type >::perturbTol(), samples(), List< T >::setSize(), and List< T >::size().

Referenced by triSurfaceMesh::findNearest(), and triSurfaceRegionSearch::findNearest().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ nearest()

Foam::pointIndexHit nearest ( const point &  pt,
const vector &  span 
) const

Calculate nearest point on surface for single searchPoint. Returns.

in pointIndexHit:

  • hit() : whether nearest point found within bounding box
  • hitPoint() : coordinate of nearest point
  • index() : surface triangle label

Definition at line 304 of file triSurfaceSearch.C.

References Foam::magSqr().

Here is the call graph for this function:

◆ findLine()

void findLine ( const pointField &  start,
const pointField &  end,
List< pointIndexHit > &  info 
) const

Definition at line 317 of file triSurfaceSearch.C.

References forAll, indexedOctree< Type >::perturbTol(), List< T >::setSize(), and List< T >::size().

Referenced by triSurfaceMesh::findLine(), and powerLawLopesdaCostaZone::powerLawLopesdaCostaZone().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ findLineAny()

void findLineAny ( const pointField &  start,
const pointField &  end,
List< pointIndexHit > &  info 
) const

Definition at line 344 of file triSurfaceSearch.C.

References indexedOctree< Type >::findLineAny(), forAll, indexedOctree< Type >::perturbTol(), List< T >::setSize(), and List< T >::size().

Referenced by triSurfaceMesh::findLineAny().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ findLineAll()

void findLineAll ( const pointField &  start,
const pointField &  end,
List< List< pointIndexHit >> &  info 
) const

Calculate all intersections from start to end.

Definition at line 371 of file triSurfaceSearch.C.

References DynamicList< T, SizeInc, SizeMult, SizeDiv >::append(), DynamicList< T, SizeInc, SizeMult, SizeDiv >::clear(), forAll, PointIndexHit< Point >::hit(), PointIndexHit< Point >::index(), Foam::mag(), indexedOctree< Type >::perturbTol(), and List< T >::size().

Referenced by triSurfaceMesh::findLineAll().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ operator=()

void operator= ( const triSurfaceSearch &  )
delete

Disallow default bitwise assignment.

The documentation for this class was generated from the following files: