Version 5.0 The LEDA User Manual

list P.intersection(const rat line& l)
r circle gen polygon P.translate(rational dx, rational dy)
r circle gen polygon P.translate(const rat vector& v)
r circle gen polygon P + const rat vector& v
returns the list of all proper intersections between l
and the boundary of P .
returns P translated by vector (dx, dy).
returns P translated by vector v.
returns P translated by vector v.
r circle gen polygon P − const rat vector& v
returns P translated by vector −v.
r circle gen 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 gen polygon P.reflect(const rat point& p, const rat point& q)
r circle gen polygon P.reflect(const rat point& p)
real P.sqr dist(const real point& p)
real P.dist(const real point& p)
r circle gen polygon P.complement( )
returns P reflected across the straight line passing
through p and q.
returns P reflected across point p.
computes the squared Euclidean distance between the
boundary of P and p. (If P is zero, the result is zero.)
computes the Euclidean distance between the boundary
of P and p. (If P is zero, the result is zero.)
returns the complement of P .
r circle gen polygon P.eliminate cocircular vertices( )
bool P.is r circle polygon( )
returns a copy of P without cocircular vertices.
checks if the boundary of P consists of at most one
chain.