Version 5.0 The LEDA User Manual

double r.height( ) returns the height of r.
bool r.is degenerate( ) returns true, if r degenerates to a segment or point
(the 4 corners are collinear), false otherwise.
bool r.is point( ) returns true, if r degenerates to a point.
bool r.is segment( ) returns true, if r degenerates to a segment.
int r.cs code(const point& p) returns the code for Cohen-Sutherland algorithm.
bool r.inside(const point& p) returns true, if p is inside of r, false otherwise.
bool r.outside(const point& p) returns true, if p is outside of r, false otherwise.
bool r.inside or contains(const point& p)
returns true, if p is inside of r or on the border,
false otherwise.
bool
r.contains(const point& p) returns true, if p is on the border of r, false otherwise.
region kind r.region of(const point& p)
returns BOUNDED REGION if p lies in the
bounded region of r, returns ON REGION if p lies
on r, and returns UNBOUNDED REGION if p lies
in the unbounded region.
rectangle r.include(const point& p) returns a new rectangle that includes the points of
r and p.
rectangle r.include(const rectangle& r2 )
returns a new rectangle that includes the points of
r and r2.
rectangle
r.translate(double dx, double dy)
returns a new rectangle that is the translation of
r by (dx, dy).
rectangle r.translate(const vector& v)
returns a new rectangle that is the translation of
r by v.
rectangle r + const vector& v returns r translated by v.
rectangle r − const vector& v returns r translated by −v.
point r[int i] returns the i − th vertex of r. Precondition: (0 <
i < 5).