Memosa-FVM
0.2
|
#include <KSearchTree.h>
Public Types | |
typedef Vector< double, 3 > | Vec3D |
typedef Array< Vec3D > | Vec3DArray |
typedef Array< int > | IntArray |
Public Member Functions | |
KSearchTree () | |
KSearchTree (const Vec3DArray &points) | |
void | insert (const Vec3D &v, const int n) |
void | findNeighbors (const Vec3D &p, const int k, Array< int > &neighbors) |
Private Types | |
typedef CGAL::Search_traits < double, MyPoint, const double *, Construct_coord_iterator > | Traits |
typedef CGAL::Orthogonal_k_neighbor_search < Traits > | K_neighbor_search |
typedef K_neighbor_search::Tree | Tree |
Private Attributes | |
boost::shared_ptr< Tree > | _tree |
A wrapper for CGAL's K_neighbor_search
Definition at line 121 of file KSearchTree.h.
typedef Array<int> KSearchTree::IntArray |
Definition at line 126 of file KSearchTree.h.
|
private |
Definition at line 139 of file KSearchTree.h.
|
private |
Definition at line 138 of file KSearchTree.h.
|
private |
Definition at line 140 of file KSearchTree.h.
typedef Vector<double,3> KSearchTree::Vec3D |
Definition at line 124 of file KSearchTree.h.
typedef Array<Vec3D> KSearchTree::Vec3DArray |
Definition at line 125 of file KSearchTree.h.
KSearchTree::KSearchTree | ( | ) |
KSearchTree::KSearchTree | ( | const Vec3DArray & | points | ) |
Definition at line 8 of file KSearchTree.cpp.
References _tree, and Array< T >::getLength().
Definition at line 30 of file KSearchTree.cpp.
References _tree.
Referenced by IBManager::createIBInterpolationStencil(), IBManager::createSolidInterpolationStencil(), Mesh::findCommonNodes(), and IBManager::findNearestCellForSolidFaces().
void KSearchTree::insert | ( | const Vec3D & | v, |
const int | n | ||
) |
Definition at line 23 of file KSearchTree.cpp.
References _tree.
Referenced by IBManager::createIBInterpolationStencil(), IBManager::createSolidInterpolationStencil(), Mesh::findCommonNodes(), and IBManager::update().
|
private |
Definition at line 142 of file KSearchTree.h.
Referenced by findNeighbors(), insert(), and KSearchTree().