Loading...
Searching...
No Matches
findUniqueIntersectOp Class Reference
Inheritance diagram for findUniqueIntersectOp:
Collaboration diagram for findUniqueIntersectOp:

Public Member Functions

 findUniqueIntersectOp (const indexedOctree< treeDataFace > &tree, const List< pointIndexHit > &hits)
 Construct from components.
bool operator() (const label index, const point &start, const point &end, point &intersectionPoint) const
 Calculate intersection of triangle with ray. Sets result.
Public Member Functions inherited from treeDataFace::findIntersectOp
 findIntersectOp (const indexedOctree< treeDataFace > &tree)
bool operator() (const label index, const point &start, const point &end, point &intersectionPoint) const
 Calculate intersection of triangle with ray.

Public Attributes

const indexedOctree< treeDataFace > & tree_
const List< pointIndexHit > & hits_

Detailed Description

Definition at line 39 of file meshSearch.C.

Constructor & Destructor Documentation

◆ findUniqueIntersectOp()

findUniqueIntersectOp ( const indexedOctree< treeDataFace > & tree,
const List< pointIndexHit > & hits )
inline

Construct from components.

Definition at line 54 of file meshSearch.C.

References treeDataFace::findIntersectOp::findIntersectOp(), hits_, tree(), and tree_.

Here is the call graph for this function:

Member Function Documentation

◆ operator()()

bool operator() ( const label index,
const point & start,
const point & end,
point & intersectionPoint ) const
inline

Calculate intersection of triangle with ray. Sets result.

accordingly

Definition at line 70 of file meshSearch.C.

References forAll, hits_, mesh, and tree_.

Member Data Documentation

◆ tree_

const indexedOctree<treeDataFace>& tree_

Definition at line 45 of file meshSearch.C.

Referenced by findUniqueIntersectOp(), and operator()().

◆ hits_

const List<pointIndexHit>& hits_

Definition at line 47 of file meshSearch.C.

Referenced by findUniqueIntersectOp(), and operator()().


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