|
Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
| BST< T, Comp > | Red-black tree with evolving order |
| compare< T, Comp > | Implementation of an evolving order |
| Event | Event for Bentley-Ottmann's algorithm |
| Point | 2D points with rational coordinates |
| PriorityQueue< T, A > | Implementation of custom priority queues |
| PriorityQueue_t< T, A > | Basic structure for a priority queue |
| Segment | 2D segment lines |
| Slope | Slope of a segment line |
1.7.4