Overview     Modules     Class Hierarchy     Classes     Members  

tlp Namespace Reference

Functions


Function Documentation

void tlp::canonicalOrdering SuperGraph *  graph,
std::vector< node > &  order
 

Build the canonical ordering of a planar triangulated graph. For information about canonical ordering the user must reffer to the planar graph drawing book.

void tlp::canonicalOrdering SuperGraph *  graph,
vector< node > &  order
 

void tlp::triangulate SuperGraph *  map,
std::vector< edge > &  addedEdges
 

This function triangulate a planar graph. (ie. add edges in the graph until each face of the planar map contains only 3 edges. The input graph must be planr in order to call this function.

void tlp::triangulate SuperGraph *  graph,
vector< edge > &  addedEdges
 



Tulip Software by David AUBER    2001 - 2006