cheshirekow
v0.1.0
|
base class for nodes, implements storage and interface for the simplex tree More...
#include <mpblocks/simplex_tree/Node.h>
Public Types | |
typedef Traits::Format | Format_t |
typedef unsigned int | Index_t |
typedef Traits::Node | Node_t |
typedef Eigen::Matrix < Format_t, Traits::NDim, 1 > | Point_t |
typedef Eigen::Matrix < Format_t, Traits::NDim, 1 > | Vector_t |
Public Member Functions | |
const Point_t & | getPoint () |
Protected Attributes | |
Point_t | m_point |
base class for nodes, implements storage and interface for the simplex tree
A node is something which is inserted into the tree. It must provide a notion of a point in {R}^n .
The proper usage is to define a member class of Traits which is the actual node class, and which derives from this class. By CTRP it will contain storage and the necessary interface for the simplex tree, but the derived class is always returned through API calls
typedef Traits::Format mpblocks::simplex_tree::Node< Traits >::Format_t |
typedef unsigned int mpblocks::simplex_tree::Node< Traits >::Index_t |
typedef Traits::Node mpblocks::simplex_tree::Node< Traits >::Node_t |
typedef Eigen::Matrix<Format_t,Traits::NDim,1> mpblocks::simplex_tree::Node< Traits >::Point_t |
typedef Eigen::Matrix<Format_t,Traits::NDim,1> mpblocks::simplex_tree::Node< Traits >::Vector_t |
const Point_t& mpblocks::simplex_tree::Node< Traits >::getPoint | ( | ) |
|
protected |