Version 5.0 The LEDA User Manual

ool s.contains(const point& p)
bool s.intersection(const segment& t)
decides whether s contains p.
bool s.intersection(const segment& t, point& p)
decides whether s and t intersect in one point.
if s and t intersect in a single point this point is assigned
to p and the result is true, otherwise the result is false.
bool s.intersection of lines(const segment& t, point& p)
segment s.translate by angle(double alpha, double d)
if line(s) and line(t) intersect in a single point this point
is assigned to p and the result is true, otherwise the result
is false.
returns s translated in direction alpha by distance d.
segment
s.translate(double dx, double dy)
returns s translated by vector (dx, dy).
segment s.translate(const vector& v)
returns s + v, i.e., s translated by vector v.
Precondition: v.dim() = 2.
segment
segment
s + const vector& v
returns s translated by vector v.
s − const vector& v
returns s translated by vector −v.
segment s.perpendicular(const point& p)
double s.distance(const point& p)
double s.sqr dist(const point& p)
returns the segment perpendicular to s with source p and
target on line(s).
returns the Euclidean distance between p and s.
returns the squared Euclidean distance between p and s.
double s.distance( ) returns the Euclidean distance between (0, 0) and s.
segment s.rotate(const point& q, double a)
returns s rotated about point q by angle a.
segment
s.rotate(double alpha)
returns s.rotate(s.source(), alpha).