DocumentCode
2617767
Title
Planar orthogonal drawings of graphs
Author
Tamassia, Roberto
Author_Institution
Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
fYear
1990
fDate
1-3 May 1990
Firstpage
319
Abstract
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
Keywords
circuit layout CAD; graph theory; area minimization; bends number minimization; planar graphs of maximum degree 4; planar orthogonal drawings of graphs; quality measures; Circuits; Computer science; Geometry; Graphics; Layout; Minimization; Shape; Topology; Very large scale integration; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/ISCAS.1990.112025
Filename
112025
Link To Document