Version 5.0 The LEDA User Manual

double P.approximate area( )
approximates the (oriented) area of the bounded region
of P .
Precondition: P.kind( ) is not full.
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.
r circle gen polygon P.unite(const r circle gen polygon& Q)
returns reg(P ∪ Q).
r circle gen polygon P.intersection(const r circle gen polygon& Q)
returns reg(P ∩ Q).
r circle gen polygon P.diff(const r circle gen polygon& Q)
returns reg(P \ Q).
r circle gen polygon P.sym diff(const r circle gen polygon& Q)
returns reg((P ∪ Q) − (P ∩ Q)).
r circle gen polygon r circle gen polygon :: unite(const list& L)
returns the (regularized) union of all polygons in L.
Iterations Macros
forall polygons(p, P ) { “the boundary polygons of P are successively assigned to
r circle polygon p” }