| box_box_intersection(const box_t &box1, const box_t &box2) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| box_contains_point(const box_t &box, const vector_t &point) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| box_diagonal(const box_t &box) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| box_t typedef | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | |
| calculate_bounding_box(box_t &boxOut, const elem_t &e, const common_data_t &commonData) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| calculate_center(vector_t ¢erOut, const elem_t &e, const common_data_t &commonData) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| contains_point(const elem_t &e, const vector_t &point, const common_data_t &commonData) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| grow_box(box_t &boxOut, const box_t &box, const vector_t &offset) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| merge_boxes(box_t &boxOut, const box_t &box1, const box_t &box2) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| real_t typedef | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | |
| split_box(box_t *boxesOut, const box_t &box, const vector_t &splitPoint) | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | static |
| vector_t typedef | ug::ntree_traits< tree_dim, world_dim, elem_t, common_data_t > | |