A collection of tools for searchableSurfaces. More...
#include <meshTools/searchableSurfacesQueries.H>
A collection of tools for searchableSurfaces.
Definition at line 52 of file searchableSurfacesQueries.H.
Public Member Functions | |
ClassName ("searchableSurfacesQueries") | |
Static Public Member Functions | |
static void | findAnyIntersection (const PtrList< searchableSurface > &, const labelList &surfacesToTest, const pointField &start, const pointField &end, labelList &surfaces, List< pointIndexHit > &) |
Find any intersection. Return hit point information and.
| |
static void | findAllIntersections (const PtrList< searchableSurface > &, const labelList &surfacesToTest, const pointField &start, const pointField &end, labelListList &surfaces, List< List< pointIndexHit > > &surfaceHits) |
Find all intersections in order from start to end. Returns for.
| |
static void | findNearest (const PtrList< searchableSurface > &, const labelList &surfacesToTest, const pointField &, const scalarField &nearestDistSqr, labelList &surfaces, List< pointIndexHit > &) |
Find nearest. Return -1 (and a miss()) or surface and nearest.
| |
static pointIndexHit | facesIntersection (const PtrList< searchableSurface > &allSurfaces, const labelList &surfacesToTest, const scalar initDistSqr, const scalar convergenceDistSqr, const point &start) |
Calculate point which is on a set of surfaces. WIP.
|
ClassName | ( | "searchableSurfacesQueries" | ) |
void findAnyIntersection | ( | const PtrList< searchableSurface > & | allSurfaces, |
const labelList & | surfacesToTest, | ||
const pointField & | start, | ||
const pointField & | end, | ||
labelList & | surfaces, | ||
List< pointIndexHit > & | hitInfo | ||
) | [static]
|
Find any intersection. Return hit point information and.
index in surfacesToTest. If multiple surfaces hit the first surface is returned, not necessarily the nearest (to start).
Definition at line 399 of file searchableSurfacesQueries.C.
References forAll, Foam::identity(), List< T >::setSize(), and List< T >::size().
Referenced by searchableSurfaces::findAnyIntersection(), and refinementSurfaces::findAnyIntersection().
void findAllIntersections | ( | const PtrList< searchableSurface > & | allSurfaces, |
const labelList & | surfacesToTest, | ||
const pointField & | start, | ||
const pointField & | end, | ||
labelListList & | surfaces, | ||
List< List< pointIndexHit > > & | surfaceHits | ||
) | [static]
|
Find all intersections in order from start to end. Returns for.
every hit the index in surfacesToTest and the hit info.
Definition at line 460 of file searchableSurfacesQueries.C.
References UList< T >::empty(), forAll, Foam::mag(), Foam::magSqr(), List< T >::setSize(), and List< T >::size().
Referenced by searchableSurfaces::findAllIntersections().
void findNearest | ( | const PtrList< searchableSurface > & | allSurfaces, |
const labelList & | surfacesToTest, | ||
const pointField & | samples, | ||
const scalarField & | nearestDistSqr, | ||
labelList & | surfaces, | ||
List< pointIndexHit > & | nearestInfo | ||
) | [static]
|
Find nearest. Return -1 (and a miss()) or surface and nearest.
point.
Definition at line 645 of file searchableSurfacesQueries.C.
References forAll, Foam::magSqr(), List< T >::setSize(), and List< T >::size().
Referenced by searchableSurfaces::findNearest(), refinementSurfaces::findNearest(), and refinementSurfaces::findNearestRegion().
Foam::pointIndexHit facesIntersection | ( | const PtrList< searchableSurface > & | allSurfaces, |
const labelList & | surfacesToTest, | ||
const scalar | initDistSqr, | ||
const scalar | convergenceDistSqr, | ||
const point & | start | ||
) | [static]
|
Calculate point which is on a set of surfaces. WIP.
Calculate point which is on a set of surfaces.
Downhill Simplex method
Definition at line 692 of file searchableSurfacesQueries.C.
References Foam::abort(), Foam::FatalError, FatalErrorIn, forAll, PointIndexHit< Point >::hit(), PointIndexHit< Point >::hitPoint(), List< T >::size(), and Vector< Cmpt >::zero.
Referenced by searchableSurfaces::facesIntersection().