|
cisst-saw
|
#include <msh2DirPDTreeBase.h>
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 | |
| msh2AlgDirPDTree * | algorithm |
| msh2DirPDTreeNode * | Top |
| int * | DataIndices |
| size_t | NData |
| size_t | NNodes |
| int | treeDepth |
Friends | |
| class | msh2DirPDTreeNode |
|
inline |
|
inlinevirtual |
|
pure virtual |
Implemented in msh2DirPDTreeEdges, and msh2DirPDTreePointCloud.
|
pure virtual |
Implemented in msh2DirPDTreeEdges, and msh2DirPDTreePointCloud.
|
pure virtual |
Implemented in msh2DirPDTreeEdges, and msh2DirPDTreePointCloud.
|
pure virtual |
Implemented in msh2DirPDTreeEdges, and msh2DirPDTreePointCloud.
| int msh2DirPDTreeBase::FastInitializeProximalDatum | ( | const vct2 & | v, |
| const vct2 & | n, | ||
| vct2 & | proxPoint, | ||
| vct2 & | proxNorm ) |
| int msh2DirPDTreeBase::FindClosestDatum | ( | const vct2 & | v, |
| const vct2 & | n, | ||
| vct2 & | closestPoint, | ||
| vct2 & | closestPointNorm, | ||
| int | prevDatum, | ||
| double & | matchError, | ||
| unsigned int & | numNodesSearched ) |
| int msh2DirPDTreeBase::FindTerminalNode | ( | int | datum, |
| msh2DirPDTreeNode ** | termNode ) |
|
inline |
|
inline |
| void msh2DirPDTreeBase::PrintTerminalNodes | ( | std::ofstream & | fs | ) |
|
inline |
|
inline |
| int msh2DirPDTreeBase::ValidateClosestDatum | ( | const vct2 & | v, |
| const vct2 & | n, | ||
| vct2 & | closestPoint, | ||
| vct2 & | closestPointNorm ) |
|
friend |
| msh2AlgDirPDTree* msh2DirPDTreeBase::algorithm |
| int* msh2DirPDTreeBase::DataIndices |
| size_t msh2DirPDTreeBase::NData |
| size_t msh2DirPDTreeBase::NNodes |
| msh2DirPDTreeNode* msh2DirPDTreeBase::Top |
| int msh2DirPDTreeBase::treeDepth |