期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2016
卷号：5
期号：1
页码：84
出版社：International Journal of Computer and Information Technology
摘要：An orthogonal drawing of a graph is a drawing such that that all edges are drawn as sequences of horizontal and vertical segments. Traditionally, the quality of orthogonal planar drawings is quantified by either the total number of bends, or the maximum number of bends per edge. Although there are many algorithms for orthogonal graph drawings, but they sometimes produce undesirable drawings. For this reason we will develop a new methodology for drawing orthogonal graphs with nodes of a prescribed size. The algorithm is based on two steps, in the first step we apply grid-based algorithm on the given graph, in this step the final drawing is achieved through three steps: node placement, edge routing and normalization. And the second step we apply the quadratic programming at the second step of the grid-based algorithm that minimize the total edge length. This technique generates an aesthetically pleasing drawing of a given graph. This is achieved clearly in the Results given in the paper.
