期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2015
卷号：12
期号：2
出版社：IJCSI Press
摘要：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 interrelationship 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 in linear time O(n).
关键词：3; Planar Graph; Graph Drawing; drawing on grid.
