By Topic

Planar orthogonal drawings of graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Tamassia, R. ; Dept. of Comput. Sci., Brown Univ., Providence, RI, USA

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

Published in:

Circuits and Systems, 1990., IEEE International Symposium on

Date of Conference:

1-3 May 1990