Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
Event for Bentley-Ottmann's algorithm. More...
#include <geometry.hpp>
Public Member Functions | |
Event () | |
Default constructor. | |
Event (const Event &e) | |
Copy constructor. | |
Event (const Point &p) | |
Assign constructor. | |
Point | get_point () const |
Reads private member point. | |
bool | operator< (const Event &) const |
Order on events. | |
Private Attributes | |
Point | point |
Point. |
Event for Bentley-Ottmann's algorithm.
Events are a certain kind of points. They are ordered (lex order) and are remarkable segment points, that is left endpoints, right endpoints and crossing points. So is one event refering to a set of segment lines having it as remarkable point.
Definition at line 175 of file geometry.hpp.
Event::Event | ( | const Event & | e | ) | [inline] |
Event::Event | ( | const Point & | p | ) | [inline] |
Assign constructor.
p | Point to assign to the event |
Definition at line 186 of file geometry.hpp.
Point Event::get_point | ( | ) | const |
Reads private member point.
Definition at line 303 of file geometry.cpp.
bool Event::operator< | ( | const Event & | e | ) | const |
Order on events.
e | Event to compare with. |
The order is induced by the lexicographic order on the (x,y)-coordinate of points.
Definition at line 289 of file geometry.cpp.