Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
Red-black tree with evolving order. More...
#include <structures.hpp>
Public Types | |
typedef std::set< T *, compare < T, Comp > > | Type |
Red-black tree with evolving order.
Type 'set' of STL is implemented by a red-black tree (wich is a binary search tree with amortized time complexity in the worst case).
The structure of tree is not harmed in any way by the changement on the order. This assertion is pretty clear and purely algorithmic and do not depend on the implementation.
Definition at line 70 of file structures.hpp.