Version 5.0 The LEDA User Manual

circle polygon P.reflect(const rat point& p)
real P.sqr dist(const real point& p)
real P.dist(const real point& p)
returns P reflected across point p.
computes the squared Euclidean distance between the
boundary of P and p. (If P is zero, the result is zero.)
computes the Euclidean distance between the boundary
of P and p. (If P is zero, the result is zero.)
r circle polygon P.complement( ) returns the complement of P .
r circle polygon P.eliminate cocircular vertices( )
returns a copy of P without cocircular vertices.
bool P.is rat polygon( ) returns whether P can be converted to a rat polygon.
rat polygon P.to rat polygon( ) converts P to a rat polygon.
Precondition: is rat polygon is true.
polygon P.to float( ) computes a floating point approximation of P with
straight line segments.
Precondition: is rat polygon is true.
bool P.is rat circle( ) returns whether P can be converted to a rat circle.
rat circle P.to rat circle( ) converts P to a rat circle.
Precondition: is rat circle is true.
void
P.bounding box(real& xmin, real& ymin, real& xmax, real& ymax)
computes a tight bounding box for P .
All functions below assume that P is weakly simple.
int P.orientation( ) returns the orientation of P .
int P.side of(const r circle point& p)
region kind P.region of(const r circle 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.