Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest.
More...
#include <hpp/fcl/broadphase/interval_tree.h>
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest.
Can be replaced in part by boost::icl::interval_set, which is only supported after boost 1.46 and does not support delete node routine.
◆ ~SimpleInterval()
virtual fcl::SimpleInterval::~SimpleInterval |
( |
| ) |
|
|
inlinevirtual |
◆ print()
virtual void fcl::SimpleInterval::print |
( |
| ) |
|
|
inlinevirtual |
◆ high
double fcl::SimpleInterval::high |
◆ low
double fcl::SimpleInterval::low |
interval is defined as [low, high]