Publisher of Iranian Journals and Conference Proceedings

Please waite ..
Publisher of Iranian Journals and Conference Proceedings
Login |Register |Help |عضویت کتابخانه ها
Paper
Title

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

مجله پیشرفت در تحقیقات کامپیوتری، دوره: 9، شماره: 4
Year: 1397
COI: JR_JACR-9-4_007
Language: EnglishView: 259
This Paper With 13 Page And PDF Format Ready To Download

Buy and Download

با استفاده از پرداخت اینترنتی بسیار سریع و ساده می توانید اصل این Paper را که دارای 13 صفحه است به صورت فایل PDF در اختیار داشته باشید.
آدرس ایمیل خود را در کادر زیر وارد نمایید:

Authors

Jafar Mohamadian - Department of computer engineering, sari branch, islamic azad university, sari ,iran
Hossein Nematzadeh - 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.

Keywords:

Paper COI Code

This Paper COI Code is JR_JACR-9-4_007. Also You can use the following address to link to this article. This link is permanent and is used as an article registration confirmation in the Civilica reference:

https://civilica.com/doc/966259/

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:
Mohamadian, Jafar and Nematzadeh, Hossein,1397,A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity,https://civilica.com/doc/966259

Research Info Management

Certificate | Report | من نویسنده این مقاله هستم

اطلاعات استنادی این Paper را به نرم افزارهای مدیریت اطلاعات علمی و استنادی ارسال نمایید و در تحقیقات خود از آن استفاده نمایید.

Scientometrics

The specifications of the publisher center of this Paper are as follows:
Type of center: Azad University
Paper count: 4,616
In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.

Share this page

More information about COI

COI stands for "CIVILICA Object Identifier". COI is the unique code assigned to articles of Iranian conferences and journals when indexing on the CIVILICA citation database.

The COI is the national code of documents indexed in CIVILICA and is a unique and permanent code. it can always be cited and tracked and assumed as registration confirmation ID.

Support