Holds (reference to) pointField. Encapsulation of data needed for octree searches. Used for searching for nearest point. No bounding boxes around points. Only overlaps and calcNearest are implemented, rest makes little sense. More...

Public Member Functions
	ClassName ("dynamicTreeDataPoint")

	dynamicTreeDataPoint (const DynamicList< point > &points)

label	size () const

const DynamicList< point > &	shapePoints () const

volumeType	getVolumeType (const dynamicIndexedOctree< dynamicTreeDataPoint > &, const point &) const

bool	overlaps (const label index, const treeBoundBox &sampleBb) const

bool	overlaps (const label index, const point &centre, const scalar radiusSqr) const

void	findNearest (const labelUList &indices, const point &sample, scalar &nearestDistSqr, label &nearestIndex, point &nearestPoint) const

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

bool	intersects (const label index, const point &start, const point &end, point &result) const

Detailed Description

Holds (reference to) pointField. Encapsulation of data needed for octree searches. Used for searching for nearest point. No bounding boxes around points. Only overlaps and calcNearest are implemented, rest makes little sense.

Optionally works on subset of points.

Source files

Definition at line 57 of file dynamicTreeDataPoint.H.

Constructor & Destructor Documentation

◆ dynamicTreeDataPoint()

dynamicTreeDataPoint ( const DynamicList< point > & points )

Definition at line 36 of file dynamicTreeDataPoint.C.

Member Function Documentation

◆ ClassName()

ClassName ( "dynamicTreeDataPoint" )

◆ size()

label size ( ) const

inline

Definition at line 79 of file dynamicTreeDataPoint.H.

◆ shapePoints()

const Foam::DynamicList< Foam::point > & shapePoints ( ) const

Definition at line 47 of file dynamicTreeDataPoint.C.

◆ getVolumeType()

Foam::volumeType getVolumeType	(	const dynamicIndexedOctree< dynamicTreeDataPoint > &	oc,
		const point &	sample
	)		const

Definition at line 54 of file dynamicTreeDataPoint.C.

References volumeType::UNKNOWN.

◆ overlaps() [1/2]

bool overlaps	(	const label	index,
		const treeBoundBox &	sampleBb
	)		const

Definition at line 64 of file dynamicTreeDataPoint.C.

References treeBoundBox::contains().

Here is the call graph for this function:

◆ overlaps() [2/2]

bool overlaps	(	const label	index,
		const point &	centre,
		const scalar	radiusSqr
	)		const

Definition at line 74 of file dynamicTreeDataPoint.C.

References Foam::magSqr(), and p.

Here is the call graph for this function:

◆ findNearest() [1/2]

void findNearest	(	const labelUList &	indices,
		const point &	sample,
		scalar &	nearestDistSqr,
		label &	nearestIndex,
		point &	nearestPoint
	)		const

Definition at line 94 of file dynamicTreeDataPoint.C.

References forAll, and Foam::magSqr().

Here is the call graph for this function:

◆ findNearest() [2/2]

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