Version 5.0 The LEDA User Manual

list r.vertices( )
returns the vertices of r in counterclockwise order
starting from the lower left point.
rational r.xmin( ) returns the minimal x-coordinate of r.
rational r.xmax( ) returns the maximal x-coordinate of r.
rational r.ymin( ) returns the minimal y-coordinate of r.
rational r.ymax( ) returns the maximal y-coordinate of r.
rational r.width( ) returns the width of r.
rational 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 rat point& p)
bool r.inside(const rat point& p)
bool r.inside or contains(const rat point& p)
bool r.outside(const rat point& p)
bool r.contains(const rat point& p)
region kind r.region of(const rat point& p)
rat rectangle r.include(const rat point& p)
returns the code for Cohen-Sutherland algorithm.
returns true, if p is inside of r, false otherwise.
returns true, if p is inside of r or on the border,
false otherwise.
returns true, if p is outside of r, false otherwise.
returns true, if p is on the border of r, false otherwise.
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.
returns a new rat rectangle that includes the points
of r and p.