Version 5.0 The LEDA User Manual

const list& P.segments( )
returns the sequence of bounding segments
of P in counterclockwise ordering.
list P.intersection(const SEGMENT & s)
list P.intersection(const LINE& l)
POLYGON P.intersect halfplane(const LINE& l)
int P.size( ) returns the size of P .
returns the proper crossings between P and
s as a list of points.
returns the proper crossings between P and
l as a list of points.
returns the intersection of P with the halfspace
on the positive side of l.
bool P.empty( ) returns true if P is empty, false otherwise.
POLYGON
POLYGON
P.translate(RAT TYPE dx, RAT TYPE dy)
returns P translated by vector (dx, dy).
P.translate(INT TYPE dx, INT TYPE dy, INT TYPE dw)
returns P translated by vector
(dx/dw, dy/dw).
POLYGON P.translate(const VECTOR& v)
returns P translated by vector v.
POLYGON P + const VECTOR& v returns P translated by vector v.
POLYGON
P − const VECTOR& v returns P translated by vector −v.
POLYGON P.rotate90(const POINT & q, int i = 1)
POLYGON P.reflect(const POINT & p, const POINT & q)
POLYGON P.reflect(const POINT & p)
RAT TYPE P.sqr dist(const POINT & p)
returns P rotated about q by an angle of i ×
90 degrees. If i > 0 the rotation is counterclockwise
otherwise it is clockwise.
returns P reflected across the straight line
passing through p and q.
returns P reflected across point p.
returns the square of the minimal Euclidean
distance between a segment in P and p. Returns
zero if P is empty.