1
Department of computer engineering, sari branch, islamic azad university, sari ,iran
2
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Abstract
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate binary trees with edge intersections and bends. Likewise, they have limitations in drawing binary trees in any arbitrary polygon with uniform distribution. The proposed algorithm which is based on calculating center of gravity in polygons draws a binary tree inside any kinds of polygon. besides center of gravity as a heuristic the segmentation process has already been used. The results which have been implemented with Microsoft Visual Basic reveal that the proposed heuristic algorithm had no edge intersection and no bend. In addition, not only the symmetry of drawing has been improved but also the computational complexity becomes less.
Mohamadian, J., Nematzadeh, H. (2018). A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity. Journal of Advances in Computer Research, 9(4), 115-127.
MLA
Jafar Mohamadian; Hossein Nematzadeh. "A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity". Journal of Advances in Computer Research, 9, 4, 2018, 115-127.
HARVARD
Mohamadian, J., Nematzadeh, H. (2018). 'A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity', Journal of Advances in Computer Research, 9(4), pp. 115-127.
VANCOUVER
Mohamadian, J., Nematzadeh, H. A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity. Journal of Advances in Computer Research, 2018; 9(4): 115-127.
)