Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
Implementation of an evolving order. More...
#include <structures.hpp>
Public Member Functions | |
compare (Comp *c) | |
Constructor. | |
bool | operator() (T *a, T *b) |
Define a comparator. | |
Public Attributes | |
Comp * | comp |
Implementation of an evolving order.
Bentley-Ottmann algorithm requires to make the order change with time. This implementation will provide it by using a pointer on an evolving paramater.
Definition at line 34 of file structures.hpp.
bool compare< T, Comp >::operator() | ( | T * | a, |
T * | b | ||
) | [inline] |
Define a comparator.
a,b | Instances of T* to compare |
Definition at line 52 of file structures.hpp.
Evolving parameter
Definition at line 35 of file structures.hpp.