38 #ifndef HPP_FCL_INTERVAL_TREE_H 39 #define HPP_FCL_INTERVAL_TREE_H 119 unsigned int recursion_node_stack_size;
121 unsigned int current_parent;
122 unsigned int recursion_node_stack_top;
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Definition: simple_interval.h:50
Main namespace.
Definition: broadphase_bruteforce.h:44
IntervalTreeNode * nil
Definition: interval_tree.h:94
Class describes the information needed when we take the right branch in searching for intervals but p...
Definition: interval_tree.h:54
unsigned int parent_index
Definition: interval_tree.h:58
IntervalTreeNode * root
Definition: interval_tree.h:92
double FCL_REAL
Definition: data_types.h:65
The node for interval tree.
Definition: interval_tree_node.h:52
Interval tree.
Definition: interval_tree.h:64
IntervalTreeNode * start_node
Definition: interval_tree.h:56
bool try_right_branch
Definition: interval_tree.h:60
#define HPP_FCL_DLLAPI
Definition: config.hh:88