Version 5.0 The LEDA User Manual

list P.simple parts( ) returns the simple parts of P as a list of
simple polygons.
list P.split into weakly simple parts( )
splits P into a set of simple polygons whose
union coincides with the inner points of P .
(This function is experimental.)
POLYGON P.complement( ) returns the complement of P .
POLYGON P.eliminate colinear vertices( )
returns a copy of P without colinear vertices.
The functions in the following group are only available for polygons. They have no counterpart
for rat polygons.
polygon P.translate by angle(double alpha, double d)
returns P translated in direction alpha by
distance d.
polygon
P.rotate(const point& p, double alpha)
returns P rotated by α degrees about p.
polygon P.rotate(double alpha) returns P rotated by α degrees about the
origin.
double P.distance(const point& p)
rat polygon P.to rational(int prec = −1)
All functions below assume that P is weakly simple.
returns the Euclidean distance between P
and p.
returns a representation of P with rational
coordinates with precision prec (cf. Section
14.10).
int P.side of(const POINT & p)
region kind P.region of(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.