Simox
2.3.74.0
|
Data Structures | |
struct | datablock |
Public Member Functions | |
VoxelTreeNDElement (float p[N], int level, VoxelTreeND< T, N > *master) | |
virtual | ~VoxelTreeNDElement () |
bool | setEntry (float p[N], const T &e) |
bool | hasEntry (float p[N]) |
T * | getEntry (float p[N]) |
VoxelTreeNDElement * | getLeaf (float pos[N]) |
VoxelTreeNDElement * | maxLeaf (const Eigen::VectorXf &pos) |
std::vector< VoxelTreeNDElement * > | getAllLeafs (const Eigen::VectorXf &pos) |
bool | isLeaf () |
T * | getEntry () |
if isLeaf the corresponding entry is returned More... | |
float | getExtend (unsigned int d) |
int | getLevel () |
Eigen::VectorXf | getVoxelCenter () |
long | countNodesRecursive () |
Protected Member Functions | |
std::vector< int > | getAllChildrenIndx (const Eigen::VectorXf &p) |
bool | write (datablock &storeData) |
bool | read (const datablock &data, const std::map< unsigned int, VoxelTreeNDElement * > &idElementMapping) |
VoxelTreeNDElement< T, N > * | createChild (float p[N]) |
int | getChildIndx (float p[N]) |
bool | covers (float p[N]) |
void | accumulateMemoryConsumtion (long &storeMemStructure, long &storeMemData) |
void | collectElements (std::vector< VoxelTreeNDElement *> &elements) |
void | propagateData (float p[N], int level, VoxelTreeND< T, N > *master) |
void | deleteData () |
VoxelTreeNDElement< T, N > * | getNextChild (int startIndex, int &storeElementNr) |
Protected Attributes | |
VoxelTreeNDElement ** | children |
T * | entry |
bool | leaf |
float | pos [N] |
int | level |
unsigned int | id |
VoxelTreeND< T, N > * | tree |
Friends | |
class | VoxelTreeND< T, N > |
A template definition for storing elements of a voxelized n-d grid. Internally the elements are copied!
|
inline |
Construct an element at position p with given extends.
|
inlinevirtual |
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inlineprotected |
|
inline |
Returns pointer to element when existing. NULL if not.
|
inline |
if isLeaf the corresponding entry is returned
|
inline |
|
inline |
|
inline |
|
inlineprotected |
|
inline |
|
inline |
Checks if there is an entry at the given position. True when this node is a leaf and the entry is set or the child at p exists and returns true on getChild(p)->hasEntry(p).
|
inline |
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inline |
Automatically checks if a new child element has to be created. A copy of e is stored.
|
inlineprotected |
|
friend |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |