Graph Embedding with Minimum Depth and Maximum External Face

We present new linear time algorithms using the SPQR-tree data structure for computing planar embeddings of planar graphs optimizing certain distance measures. Experience with orthogonal drawings generated by the topology-shape-metrics approach shows that planar embeddings following these distance measures lead to improved quality of the final drawing in terms of bends, edge length, and drawing area.

[1]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[2]  Carlo Batini,et al.  Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..

[3]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[4]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[5]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[6]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[7]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[8]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..

[9]  Walter Didimo,et al.  Computing Orthogonal Drawings in a Variable Embedding Setting , 1998, ISAAC.

[10]  Roberto Tamassia,et al.  Minimum Depth Graph Embedding , 2000, ESA.

[11]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[12]  Walter Didimo,et al.  Computing Orthogonal Drawings with the Minimum Number of Bends , 1997, IEEE Trans. Computers.

[13]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[14]  René Weiskircher,et al.  New applications of SPQR-trees in graph drawing , 2002 .

[15]  Petra Mutzel,et al.  Bend Minimization in Orthogonal Drawings Using Integer Programming , 2002, COCOON.

[16]  Mike S. Paterson Algorithms - ESA 2000 , 2003, Lecture Notes in Computer Science.

[17]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[18]  Kurt Mehlhorn,et al.  On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm , 2005, Algorithmica.

[19]  Clyde L. Monma,et al.  On the complexity of embedding planar graphs to minimize certain distance measures , 2005, Algorithmica.