Version 5.0 The LEDA User Manual

at rectangle r.include(const rat rectangle& r2 )
rat rectangle r.translate(rational dx, rational dy)
rat rectangle r.translate(const rat vector& v)
returns a new rat rectangle that includes the points
of r and r2.
returns r translated by (dx, dy).
returns r translated by v.
rat rectangle r + const rat vector& v returns r translated by v.
rat rectangle r − const rat vector& v
returns r translated by vector −v.
rat point r[int i] returns the i − th vertex of r. Precondition: (0 <
i < 5).
rat rectangle r.rotate90(const rat point& p, int i = 1)
rat rectangle r.rotate90(int i = 1)
rat rectangle r.reflect(const rat point& p)
returns r rotated about q by an angle of i × 90
degrees. If i > 0 the rotation is counter-clockwise
otherwise it is clockwise.
returns r rotated by an angle of i × 90 degrees
about the origin.
returns r reflected across p.
bool
bool
bool
r.clip(const rat segment& t, rat segment& inter)
clips t on r and returns the result in inter.
r.clip(const rat line& l, rat segment& inter)
clips l on r and returns the result in inter.
r.clip(const rat ray& ry, rat segment& inter)
clips ry on r and returns the result in inter.
bool r.difference(const rat rectangle& q, list& L)
returns true iff the difference of r and q is not
empty, and false otherwise. The difference L is
returned as a partition into rectangles.
list r.intersection(const rat segment& s)
returns r ∩ s.
list r.intersection(const rat line& l)
returns r ∩ l.