Version 5.0 The LEDA User Manual

int P.side of(const POINT & p)
region kind P.region of(const POINT & p)
bool 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 +1 if p lies to the left of P , 0 if p lies
on P , and −1 if p lies to the right of P .
returns BOUNDED REGION if p lies
in the bounded region of P , returns
ON REGION if p lies on P , and returns
UNBOUNDED REGION if p lies in the unbounded
region. The bounded region of the
full polygon is the entire plane.
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 .
Precondition: P is not the full polygon.
All binary boolean operations are regularized, i.e., the result R of the standard boolean
operation is replaced by the interior of the closure of R. We use reg X to denote the
regularization of a set X.
GEN POLYGON P.unite(const GEN POLYGON & Q)
returns reg(P ∪ Q).
GEN POLYGON P.intersection(const GEN POLYGON & Q)
returns reg(P ∩ Q).
GEN POLYGON P.diff(const GEN POLYGON & Q)
returns reg(P \ Q).
GEN POLYGON P.sym diff(const GEN POLYGON & Q)
returns reg((P ∪ Q) − (P ∩ Q)).