|  | MFEM v4.8.0
    Finite element discretization library | 
Abstract base class for KDTree. Can be used when the dimension of the space is known dynamically. More...
#include <kdtree.hpp>
| Public Member Functions | |
| virtual void | AddPoint (const Tfloat *xx, Tindex ii)=0 | 
| Adds a point to the tree. See KDTree::AddPoint(). | |
| virtual void | Sort ()=0 | 
| Sorts the tree. Should be performed after adding points and before performing queries. See KDTree::Sort(). | |
| virtual Tindex | FindClosestPoint (const Tfloat *xx) const =0 | 
| Returns the index of the closest point to xx. | |
| virtual | ~KDTreeBase () | 
| Virtual destructor. | |
Abstract base class for KDTree. Can be used when the dimension of the space is known dynamically.
Definition at line 91 of file kdtree.hpp.
| 
 | inlinevirtual | 
Virtual destructor.
Definition at line 102 of file kdtree.hpp.
| 
 | pure virtual | 
Adds a point to the tree. See KDTree::AddPoint().
Implemented in mfem::KDTree< Tindex, Tfloat, ndim, Tnorm >, and mfem::KDTree< int, real_t, 3 >.
| 
 | pure virtual | 
Returns the index of the closest point to xx.
Implemented in mfem::KDTree< Tindex, Tfloat, ndim, Tnorm >, and mfem::KDTree< int, real_t, 3 >.
| 
 | pure virtual | 
Sorts the tree. Should be performed after adding points and before performing queries. See KDTree::Sort().
Implemented in mfem::KDTree< Tindex, Tfloat, ndim, Tnorm >, and mfem::KDTree< int, real_t, 3 >.