By Topic

Orthogonal point-set embeddings of 3-connected and 4-connected planar 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

2 Author(s)
Chowdhury, M.E. ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA ; Rahman, M.S.

An orthogonal point-set embedding of a planar graph G on a set S of points in Euclidean plane is a drawing of G where each vertex of G is placed on a point of S, each edge is drawn as a sequence of alternate horizontal and vertical line segments and any two edges do not cross except at their common end. In this paper, we devise an algorithm for orthogonal point-set embedding of 3-connected cubic planar graphs having a hamiltonian cycle with at most (5n over 2 + 2) bends, where n is the number of vertices in G. We also give an algorithm for finding an orthogonal point-set embedding of 4-connected planar graphs with at most 6n bends. Both the algorithms run in linear time. To the best of our knowledge this is the first work on orthogonal point-set embeddings with fewer bends.

Published in:

Computer and Information Technology (ICCIT), 2011 14th International Conference on

Date of Conference:

22-24 Dec. 2011