Version 5.0 The LEDA User Manual

ool P.inside(const POINT & p)
bool P.on boundary(const POINT & p)
bool P.outside(const POINT & p)
bool P.contains(const POINT & p)
returns true if p lies to the left of P , i.e.,
side of (p) == +1.
returns true if p lies on P , i.e., side of (p)==
0.
returns true if p lies to the right of P , i.e.,
side of (p) == −1.
returns true if p lies to the left of or on P .
RAT TYPE P.area( ) returns the signed area of the bounded region
of P . The sign of the area is positive if
the bounded region is the positive side of P .
int P.orientation( ) returns the orientation of P .
void
P.bounding box(POINT& xmin, POINT & ymin, POINT & xmax,
POINT& ymax)
returns the coordinates of a rectangular
bounding box of P .
Iterations Macros
forall vertices(v, P ) { “the vertices of P are successively assigned to rat point v” }
forall segments(s, P ) { “the edges of P are successively assigned to rat segment s” }
Non-Member Functions
POLYGON
reg n gon(int n, CIRCLE C, double epsilon)
generates a (nearly) regular n-gon
whose vertices lie on the circle
C. The i-th point is generated by
C.point of circle(2πi/n, epsilon). With
the rational kernel the vertices of the n-gon
are guaranteed to lie on the circle, with
the floating point kernel they are only
guaranteed to lie near C.