Version 5.0 The LEDA User Manual

const rat point& p.to rat point( )
converts p to a rat point.
Precondition: is rat point returns true.
r circle point p.translate(rational dx, rational dy)
r circle point p.translate(const rat vector& v)
r circle point p + const rat vector& v
r circle point p − const rat vector& v
returns p translated by vector (dx, dy).
returns p translated by vector v.
returns p translated by vector v.
returns p translated by vector −v.
r circle point p.rotate90(const rat point& q, int i = 1)
r circle point p.reflect(const rat point& p, const rat point& q)
r circle point p.reflect(const rat point& p)
returns p rotated about q by an angle of i×90 degrees.
If i > 0 the rotation is counter-clockwise otherwise it
is clockwise.
returns p reflected across the straight line passing
through p and q.
returns p reflected across point p.
bool
bool
r circle point :: intersection(const rat circle& c, const rat line& l, tag which,
real point& p)
checks whether (c, l, which) is a valid triple, if so the
corresponding point is assigned to the real point p.
r circle point :: intersection(const rat circle& c, const rat line& l, tag which,
r circle point& p)
same as above, except for the fact that p is of type
r circle point.