Planar undirected

The number of distinct embeddings is exponential in the worst case triconnected planar graphs have a unique embedding. The Complexity of Planarity

19p audi123 31-07-2010 84 10   Download

Planarization method s if the graph is nonplanar, make it planar! (by placing dummy vertices at the crossings) s use one of the drawing algorithms for planar graphs e.g., GIOTTO [Tamassia Batini Di Battista 87] Orientation method s orient the graph into a digraph s use one the drawing algorithms for digraphs Force-Directed method s define a system of forces acting on the vertices and edges s find a minimum energy state (solve differential equations or simulate the evolution of the system)

15p audi123 31-07-2010 91 10   Download