structures.hpp File Reference

Declaration of structures needed in Bentley-Ottmann's algorithm. More...

#include <set>
#include <vector>
#include <map>

Include dependency graph for structures.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	compare< T, Comp >
	Implementation of an evolving order. More...
struct	BST< T, Comp >
	Red-black tree with evolving order. More...
struct	PriorityQueue_t< T, A >
	Basic structure for a priority queue. More...
class	PriorityQueue< T, A >
	Implementation of custom priority queues. More...

---

Detailed Description

Declaration of structures needed in Bentley-Ottmann's algorithm.

Author:

Pierre Cagne

Date:

07/10/2001

This file defines two structures used in Bentley-Ottmann's algorithm. First, a binary search tree to maintain an order on some objects. Next, a priority queue with associated elements and the possibility of a quick research of a element. Those two structures require the STL and assure that all actions are made in a logarithmic way.

Definition in file structures.hpp.