Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
Public Member Functions | Private Attributes
Event Class Reference

Event for Bentley-Ottmann's algorithm. More...

#include <geometry.hpp>

Collaboration diagram for Event:
Collaboration graph
[legend]

List of all members.

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.

Detailed Description

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.


Constructor & Destructor Documentation

Event::Event ( const Event e) [inline]

Copy constructor.

Parameters:
eEvent to copy

Definition at line 183 of file geometry.hpp.

Event::Event ( const Point p) [inline]

Assign constructor.

Parameters:
pPoint to assign to the event

Definition at line 186 of file geometry.hpp.


Member Function Documentation

Point Event::get_point ( ) const

Reads private member point.

Returns:
Point of the event.

Definition at line 303 of file geometry.cpp.

bool Event::operator< ( const Event e) const

Order on events.

Parameters:
eEvent to compare with.
Returns:
True if and only if the current event is less than e

The order is induced by the lexicographic order on the (x,y)-coordinate of points.

Definition at line 289 of file geometry.cpp.


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