Improvements of tribe geneatic drawing algorithm

• Main Authors: Jian-Tai Zheng, 鄭健台
• Other Authors: none
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/42000728630066279741

碩士 === 國立中央大學 === 資訊工程研究所 === 95 === The data structure seen most frequently in the computer science is graph, and the graph is composed of nodes and edges. The graph often becomes complicated with a large number of data, so we must change the complicated graph into the graph that is clear and easy to understand by using computer. In the [Hsieh05], it provides a drawing algorithm which is based on the genetic algorithm to draw a tree in the rectilinear polygon on the two-dimentional space. By using Hierarchical layout, the drawing algorithm contracts a tree and expands it hierarchically. However, the drawing algorithm has many disadvantages. It spends a lot of time drawing a complicated tree; designs for crossover and mutation are not good enough, and aesthetic criteria can’t pick out a proper tree. This paper focuses on improving the drawing algorithm. We improve the initial state of species to prevent lasting execution time, provide new designs for crossover and mutation, and join a new concept in aesthetic criteria.