cisst-saw
Loading...
Searching...
No Matches
msh2DirPDTreeBase Class Referenceabstract

#include <msh2DirPDTreeBase.h>

Inheritance diagram for msh2DirPDTreeBase:
msh2DirPDTreeEdges msh2DirPDTreePointCloud

Public Member Functions

 msh2DirPDTreeBase ()
virtual ~msh2DirPDTreeBase ()
void SetSearchAlgorithm (msh2AlgDirPDTree *alg)
int FindClosestDatum (const vct2 &v, const vct2 &n, vct2 &closestPoint, vct2 &closestPointNorm, int prevDatum, double &matchError, unsigned int &numNodesSearched)
int FastInitializeProximalDatum (const vct2 &v, const vct2 &n, vct2 &proxPoint, vct2 &proxNorm)
size_t NumData () const
size_t NumNodes () const
int TreeDepth () const
int ValidateClosestDatum (const vct2 &v, const vct2 &n, vct2 &closestPoint, vct2 &closestPointNorm)
int FindTerminalNode (int datum, msh2DirPDTreeNode **termNode)
void PrintTerminalNodes (std::ofstream &fs)
virtual vct2 DatumSortPoint (int datum) const =0
virtual vct2 DatumNorm (int datum) const =0
virtual void EnlargeBounds (const vctFrm2 &F, int datum, msh2BoundingBox &BB) const =0
virtual void EnlargeBounds (int datum, msh2BoundingBox &BB) const =0

Public Attributes

msh2AlgDirPDTreealgorithm
msh2DirPDTreeNodeTop
int * DataIndices
size_t NData
size_t NNodes
int treeDepth

Friends

class msh2DirPDTreeNode

Constructor & Destructor Documentation

◆ msh2DirPDTreeBase()

msh2DirPDTreeBase::msh2DirPDTreeBase ( )
inline

◆ ~msh2DirPDTreeBase()

virtual msh2DirPDTreeBase::~msh2DirPDTreeBase ( )
inlinevirtual

Member Function Documentation

◆ DatumNorm()

virtual vct2 msh2DirPDTreeBase::DatumNorm ( int datum) const
pure virtual

◆ DatumSortPoint()

virtual vct2 msh2DirPDTreeBase::DatumSortPoint ( int datum) const
pure virtual

◆ EnlargeBounds() [1/2]

virtual void msh2DirPDTreeBase::EnlargeBounds ( const vctFrm2 & F,
int datum,
msh2BoundingBox & BB ) const
pure virtual

◆ EnlargeBounds() [2/2]

virtual void msh2DirPDTreeBase::EnlargeBounds ( int datum,
msh2BoundingBox & BB ) const
pure virtual

◆ FastInitializeProximalDatum()

int msh2DirPDTreeBase::FastInitializeProximalDatum ( const vct2 & v,
const vct2 & n,
vct2 & proxPoint,
vct2 & proxNorm )

◆ FindClosestDatum()

int msh2DirPDTreeBase::FindClosestDatum ( const vct2 & v,
const vct2 & n,
vct2 & closestPoint,
vct2 & closestPointNorm,
int prevDatum,
double & matchError,
unsigned int & numNodesSearched )

◆ FindTerminalNode()

int msh2DirPDTreeBase::FindTerminalNode ( int datum,
msh2DirPDTreeNode ** termNode )

◆ NumData()

size_t msh2DirPDTreeBase::NumData ( ) const
inline

◆ NumNodes()

size_t msh2DirPDTreeBase::NumNodes ( ) const
inline

◆ PrintTerminalNodes()

void msh2DirPDTreeBase::PrintTerminalNodes ( std::ofstream & fs)

◆ SetSearchAlgorithm()

void msh2DirPDTreeBase::SetSearchAlgorithm ( msh2AlgDirPDTree * alg)
inline

◆ TreeDepth()

int msh2DirPDTreeBase::TreeDepth ( ) const
inline

◆ ValidateClosestDatum()

int msh2DirPDTreeBase::ValidateClosestDatum ( const vct2 & v,
const vct2 & n,
vct2 & closestPoint,
vct2 & closestPointNorm )

◆ msh2DirPDTreeNode

friend class msh2DirPDTreeNode
friend

Member Data Documentation

◆ algorithm

msh2AlgDirPDTree* msh2DirPDTreeBase::algorithm

◆ DataIndices

int* msh2DirPDTreeBase::DataIndices

◆ NData

size_t msh2DirPDTreeBase::NData

◆ NNodes

size_t msh2DirPDTreeBase::NNodes

◆ Top

msh2DirPDTreeNode* msh2DirPDTreeBase::Top

◆ treeDepth

int msh2DirPDTreeBase::treeDepth

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