Loading...
Searching...
No Matches
treeDataEdge::findNearestOp Class Reference

Forward to treeDataEdge findNearest operations. More...

#include <treeDataEdge.H>

Public Member Functions

 findNearestOp (const indexedOctree< treeDataEdge > &tree)
void operator() (const labelUList &indices, const point &sample, scalar &nearestDistSqr, label &minIndex, point &nearestPoint) const
void operator() (const labelUList &indices, const linePointRef &ln, treeBoundBox &tightest, label &minIndex, point &linePoint, point &nearestPoint) const

Detailed Description

Forward to treeDataEdge findNearest operations.

Definition at line 102 of file treeDataEdge.H.

Constructor & Destructor Documentation

◆ findNearestOp()

findNearestOp ( const indexedOctree< treeDataEdge > & tree)

Definition at line 359 of file treeDataEdge.C.

References tree().

Here is the call graph for this function:

Member Function Documentation

◆ operator()() [1/2]

void operator() ( const labelUList & indices,
const point & sample,
scalar & nearestDistSqr,
label & minIndex,
point & nearestPoint ) const

Definition at line 401 of file treeDataEdge.C.

◆ operator()() [2/2]

void operator() ( const labelUList & indices,
const linePointRef & ln,
treeBoundBox & tightest,
label & minIndex,
point & linePoint,
point & nearestPoint ) const

Definition at line 422 of file treeDataEdge.C.

References boundBox::grow(), treeDataEdge::line(), Foam::ln(), line< Point, PointRef >::nearestDist(), Foam::sqr(), and treeDataEdge::treeDataEdge().

Here is the call graph for this function:
The documentation for this class was generated from the following files: