Version 5.0 The LEDA User Manual

ational s.y abs( ) returns the y-abscissa of line(s), i.e., s.y proj(0).
Precondition: s is not vertical.
bool s.contains(const rat point& p)
decides whether s contains p.
bool s.intersection(const rat segment& t)
decides whether s and t intersect.
bool s.intersection(const rat segment& t, rat point& p)
decides whether s and t intersect.
intersection is assigned to p.
If so, some point of
bool
s.intersection(const rat segment& t, rat segment& inter)
decides whether s and t intersect. If so, the segment formed
by the points of intersection is assigned to inter.
bool s.intersection of lines(const rat segment& t, rat point& p)
bool s.overlaps(const rat segment& t)
decides if the lines supporting s and t intersect in a single
point. If so, the point of intersection is assigned to p.
Precondition: s and t are nontrivial.
decides whether s and t overlap, i.e. they have a non-trivial
intersection.
rat segment s.translate(const rational& dx, const rational& dy)
returns s translated by vector (dx, dy).
rat segment s.translate(const integer& dx, const integer& dy, const integer& dw)
rat segment s.translate(const rat vector& v)
rat segment s + const rat vector& v
rat segment s − const rat vector& v
returns s translated by vector (dx/dw, dy/dw).
returns s + v, i.e., s translated by vector v.
Precondition: v.dim() = 2.
returns s translated by vector v.
returns s translated by vector −v.
rat segment s.rotate90(const rat point& q, int i = 1)
returns s rotated about q by an angle of i × 90 degrees.
If i > 0 the rotation is counter-clockwise otherwise it is
clockwise.