31.01.2014 Views

Version 5.0 The LEDA User Manual

Version 5.0 The LEDA User Manual

Version 5.0 The LEDA User Manual

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

GEN POLYGON GEN POLYGON :: make weakly simple(const POLYGON & p)<br />

3. Operations<br />

creates a weakly simple generalized polygon GP from<br />

a possibly non-simple polygon P such that GP and P<br />

have the same inner points. (This function is experimental.)<br />

bool P.empty( ) returns true if P is empty, false otherwise.<br />

bool P.full( ) returns true if P is the entire plane, false<br />

otherwise.<br />

bool P.trivial( ) returns true if P is either empty or full, false<br />

otherwise.<br />

bool P.is convex( ) returns true if P is convex, false otherwise.<br />

KIND P.kind( ) returns the kind of P .<br />

gen polygon P.to float( ) returns a floating point approximation of P .<br />

void P.normalize( ) simplifies the homogenous representation by<br />

calling p.normalize( ) for every vertex p of<br />

P .<br />

bool P.is simple( ) returns true if the polygonal region is simple,<br />

i.e., if the graph defined by the segments in<br />

the boundary of P has only vertices of degree<br />

two.<br />

bool<br />

bool<br />

GEN POLYGON :: check representation(const list& PL)<br />

checks whether PL is a boundary representation.<br />

P.check representation( ) tests whether the representation of P is OK.<br />

This test is partial.<br />

void P.canonical rep( ) NOT IMPLEMENTED YET.<br />

list P.vertices( ) returns the concatenated vertex lists of all<br />

polygons in the boundary representation of<br />

P .<br />

list P.edges( ) returns the concatenated edge lists of all<br />

polygons in the boundary representation of<br />

P .<br />

const list& P.polygons( )<br />

returns the lists of all polygons in the boundary<br />

representation of P .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!