Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
get_left() const | Segment | |
get_right() const | Segment | |
high(const Point &) const | Segment | |
intersect(const Segment &, Point &) const | Segment | |
is_in(const Point &) const | Segment | |
is_lend(const Point &) const | Segment | |
is_rend(const Point &) const | Segment | |
left | Segment | [private] |
less(const Segment &, const Point &) const | Segment | |
right | Segment | [private] |
Segment() | Segment | [inline] |
Segment(const Segment &seg) | Segment | [inline] |
Segment(const Point &a, const Point &b) | Segment | [inline] |
Segment(const rat &xa, const rat &ya, const rat &xb, const rat &yb) | Segment | [inline] |
slope | Segment | [private] |