ug4
|
Public Member Functions | |
Node () | |
Node (const Node &n) | |
Public Attributes | |
size_t | childNodeInd [s_numChildren] |
size_t | firstEntryInd |
< index into m_nodes. s_invalidIndex: no child node. More... | |
size_t | lastEntryInd |
index into m_entries. s_invalidIndex: no entry More... | |
size_t | level |
box_t | looseBox |
loose bounding box - contains all bounding boxes of its entries More... | |
size_t | numEntries |
number of entries in the node More... | |
box_t | tightBox |
tight bounding box - disjunct partition of the root box More... | |
The tree is built as a hierarchy of nodes. Leaf nodes contain entries.
|
inline |
References ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::childNodeInd, ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::looseBox, ug::ntree< tree_dim, world_dim, TElem, TCommonData >::s_invalidIndex, ug::ntree< tree_dim, world_dim, TElem, TCommonData >::s_numChildren, and ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::tightBox.
size_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::childNodeInd[s_numChildren] |
size_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::firstEntryInd |
< index into m_nodes. s_invalidIndex: no child node.
index into m_entries. s_invalidIndex: no entry
Referenced by ug::ntree< tree_dim, world_dim, TElem, TCommonData >::add_entry_to_node(), ug::ntree< tree_dim, world_dim, TElem, TCommonData >::calculate_center_of_mass(), ug::ntree< tree_dim, world_dim, TElem, TCommonData >::rebalance(), and ug::ntree< tree_dim, world_dim, grid_elem_t *, NTreeGridData< world_dim > >::split_leaf_node().
size_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::lastEntryInd |
index into m_entries. s_invalidIndex: no entry
Referenced by ug::ntree< tree_dim, world_dim, TElem, TCommonData >::add_entry_to_node(), and ug::ntree< tree_dim, world_dim, TElem, TCommonData >::rebalance().
size_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::level |
box_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::looseBox |
loose bounding box - contains all bounding boxes of its entries
Referenced by ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::Node(), and ug::ntree< tree_dim, world_dim, grid_elem_t *, NTreeGridData< world_dim > >::split_leaf_node().
size_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::numEntries |
box_t ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::tightBox |
tight bounding box - disjunct partition of the root box
Referenced by ug::ntree< tree_dim, world_dim, TElem, TCommonData >::find_leaf_node(), ug::ntree< tree_dim, world_dim, TElem, TCommonData >::Node::Node(), and ug::ntree< tree_dim, world_dim, grid_elem_t *, NTreeGridData< world_dim > >::split_leaf_node().