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.

void M.assign(face f, const ftype& x)<br />

makes x the information of face f.<br />

edge M.new edge(edge e1 , edge e2 , const ftype& y)<br />

edge M.split edge(edge e, const vtype& x)<br />

node M.new node(list& el, const vtype& x)<br />

node M.new node(face f, const vtype& x)<br />

4. Implementation<br />

inserts the edge e = (source(e 1 ), source(e 2 )) and its<br />

reversal edge e ′ into M.<br />

Precondition: e 1 and e 2 are bounding the same face<br />

F .<br />

<strong>The</strong> operation splits F into two new faces f, adjacent<br />

to edge e, and f ′ , adjacent to edge e ′ , with inf(f) =<br />

inf (F ) and inf(f ′ ) = y.<br />

splits edge e = (v, w) and its reversal r = (w, v) into<br />

edges (v, u), (u, w), (w, u), and (u, v). Assigns information<br />

x to the created node u and returns the edge<br />

(u, w).<br />

splits the face bounded by the edges in el by inserting<br />

a new node u and connecting it to all source nodes of<br />

edges in el. Assigns information x to u and returns<br />

u.<br />

Precondition: all edges in el bound the same face.<br />

splits face f into triangles by inserting a new node u<br />

with information x and connecting it to all nodes of<br />

f. Returns u.<br />

Parameterized planar maps are derived from planar maps. All additional operations for<br />

manipulating the node and edge contents take constant time.

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

Saved successfully!

Ooh no, something went wrong!