By Topic

Optimal rectilinear drawing of a graph whose vertices are fixed on a plane

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
$33 $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

2 Author(s)
T. Takahashi ; Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan ; Y. Kajitani

The concept of the riveted graph (G) is introduced. The minimum number l(G) of line segments for a rectilinear drawing of G is evaluated. Some elementary properties of rectilinear drawings are discussed. It is shown that l(G )⩽4m for any G where m is the number of edges. It is shown that l(G)⩽3m if G has no pair of vertices with the same x or y coordinate. The proof of each result includes an O( m) time algorithm of drawing. Some results on the lower bounds of l(G) for a given graph G are presented

Published in:

Circuits and Systems, 1990., IEEE International Symposium on

Date of Conference:

1-3 May 1990