Planar orthogonal drawings of graphs

A survey of algorithms for constructing orthogonal drawings of planar graphs, where each edge is represented by a polygonal chain consisting of horizontal and vertical segments, is presented. The main quality measures considered are the minimization of the number of bends and of the area of the drawing. Only planar graphs of maximum degree 4 are considered. Any such graph has no more than 2n edges, where n is the number of vertices of the graph.<<ETX>>

[1]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[2]  D. Dolev,et al.  Planar Embedding of Planar Graphs , 1983 .

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

[4]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[5]  Jeffrey Scott Vitter,et al.  Optimal parallel algorithms for transitive closure and point location in planar structures , 1989, SPAA '89.

[6]  Ioannis G. Tollis,et al.  Representations of Graphs on a Cylinder , 1991, SIAM J. Discret. Math..

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

[8]  David G. Kirkpatrick,et al.  Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract) , 1989, WADS.

[9]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  James A. Storer,et al.  On minimal-node-cost planar embeddings , 1984, Networks.

[11]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[12]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[13]  Avi Wigderson,et al.  Rectilinear Graphs and their Embeddings , 1985, SIAM J. Comput..

[14]  Frank Hoffmann,et al.  Embedding rectilinear graphs in linear time , 1988 .

[15]  M.N.S. Swamy,et al.  Planar embedding: linear-time algorithms for vertex placement and edge orderings , 1988 .

[16]  Ioannis G. Tollis,et al.  Area requirement and symmetry display in drawing graphs , 1989, SCG '89.

[17]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

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

[19]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.