New Algorithm for Drawings of 3-Planar Graphs

Shimaa E. Waheed, Mohamed A. El-Sayed, Amal Ali M. Mady, S. Abdel-Khalek


Graphs arise in a natural way in many applications, together with the need to be drawn. Except for very small instances, drawing a graph by hand becomes a very complex task, which must be performed by automatic tools. The field of graph drawing is concerned with finding algorithms to draw graph in an aesthetically pleasant way, based upon a certain number of aesthetic criteria that define what a good drawing, (synonyms: diagrams, pictures, layouts), of a graph should be. This problem can be found in many such as in the computer networks, data networks, class inter-relationship diagrams in object oriented databases and object oriented programs, visual programming interfaces, database design systems, software engineering…etc.

Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper we introduce a new algorithms that finds an embedding of 3-planar graph.

Keywords: 3- Planar Graph; Graph Drawing; drawing on grid.

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email:
ISSN (Paper)2224-5782 ISSN (Online)2225-0506
Please add our address "" into your email contact list.
This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.
Copyright ©