Version 5.0 The LEDA User Manual

CHECK TYPE P.check simplicity( )
checks P for simplicity. The result can be SIMPLE,
WEAKLY SIMPLE or NOT WEAKLY SIMPLE.
bool P.is convex( ) returns true iff P is convex.
int P.size( ) returns the size of P .
const list& P.segments( )
list P.vertices( ) returns the vertices of P .
list P.intersection(const r circle segment& s)
list P.intersection(const rat line& l)
r circle polygon P.intersection halfplane(const rat line& l)
r circle polygon P.translate(rational dx, rational dy)
r circle polygon P.translate(const rat vector& v)
r circle polygon P + const rat vector& v
r circle polygon P − const rat vector& v
returns a chain of segments that bound P . The orientation
of the chain corresponds to the orientation of
P .
returns the list of all proper intersections between s
and the boundary of P .
returns the list of all proper intersections between l
and the boundary of P .
clips P against the halfplane on the positive side of
l. Observe that the result is only guaranteed to be
weakly simple if P is convex.
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 polygon P.rotate90(const rat point& q, int i = 1)
returns P rotated about q by an angle of i×90 degrees.
If i > 0 the rotation is counter-clockwise otherwise it
is clockwise.
r circle polygon P.reflect(const rat point& p, const rat point& q)
returns P reflected across the straight line passing
through p and q.