Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
BST< T, Comp >Red-black tree with evolving order
compare< T, Comp >Implementation of an evolving order
EventEvent for Bentley-Ottmann's algorithm
Point2D points with rational coordinates
PriorityQueue< T, A >Implementation of custom priority queues
PriorityQueue_t< T, A >Basic structure for a priority queue
Segment2D segment lines
SlopeSlope of a segment line
 All Classes Files Functions Variables Typedefs Enumerations