Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
Public Member Functions | Public Attributes
compare< T, Comp > Class Template Reference

Implementation of an evolving order. More...

#include <structures.hpp>

List of all members.

Public Member Functions

 compare (Comp *c)
 Constructor.
bool operator() (T *a, T *b)
 Define a comparator.

Public Attributes

Comp * comp

Detailed Description

template<class T, class Comp>
class compare< T, 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.

See also:
Segment

Definition at line 34 of file structures.hpp.


Constructor & Destructor Documentation

template<class T, class Comp>
compare< T, Comp >::compare ( Comp *  c) [inline]

Constructor.

Parameters:
cInitializer

Definition at line 43 of file structures.hpp.


Member Function Documentation

template<class T, class Comp>
bool compare< T, Comp >::operator() ( T *  a,
T *  b 
) [inline]

Define a comparator.

Parameters:
a,bInstances of T* to compare
Returns:
True if and only if a < b regarding to the 'less' method

Definition at line 52 of file structures.hpp.


Member Data Documentation

template<class T, class Comp>
Comp* compare< T, Comp >::comp

Evolving parameter

Definition at line 35 of file structures.hpp.


The documentation for this class was generated from the following file:
 All Classes Files Functions Variables Typedefs Enumerations