Version 5.0 The LEDA User Manual

circle gen polygon P (const rat circle& circ, RESPECT TYPE respect orient =
RESPECT ORIENTATION );
creates a polygon P whose boundary is the circle circ.
4. Operations
KIND P.kind( ) returns the kind of P .
bool P.is trivial( ) returns true iff P is trivial.
bool P.is empty( ) returns true iff P is empty.
bool P.is full( ) returns true iff P is full.
void P.normalize( ) simplifies the representation by calling c.normalize( )
for every polygonal chain c of P .
bool P.is simple( ) tests whether P is simple or not.
bool P.is weakly simple( ) tests whether P is weakly simple or not.
bool
r circle gen polygon :: check representation(const list& polys,
CHECK TYPE check =
WEAKLY SIMPLE )
checks whether polys is a boundary representation.
Currently the nesting order is not checked, we check
only for (weak) simplicity.
bool P.check representation( )
checks the representation of P (see above).
bool P.is convex( ) returns true iff P is convex.
int P.size( ) returns the size of P , i.e. the number of segments in
its boundary representation.
const list& P.polygons( )
returns the boundary representation of P .
list P.edges( )
returns a chain of segments that bound P . The orientation
of the chain corresponds to the orientation of
P .
list P.vertices( ) returns the vertices of P .
list P.intersection(const r circle segment& s)
returns the list of all proper intersections between s
and the boundary of P .