Planar orthogonal drawings of graphs
Roberto Tamassia · 2002
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.>