Guo, "Drawing Undirected Graphs with Genetic Algorithms", L. Wang, K. Chen and Y. Ong (Editors), Advances in Natural Computation, Vol. 3612 of Lecture Notes in Computer Science, pp. 28-36, Springer, 2005.Qing-Guo Zhang, Hua-yong LIU, Wei Zhang, Ya-jun GUO, and ZHANG WEI. Drawing...
In this paper, a new general binary tree drawing algorithm frame is de signed by using genetic algorithms. Under the frame, according to different appl ications, different binary drawing algorithms can be obtained by designing diffe rent objective functions reflecting aesthetic criteria. Furthermore,...
Experimental results demonstrate that artworks created using genetic algorithms to generate drawing paths exhibit distinct colour-layering effects, emphasising the characteristics of pencil strokes. In comparison with previous methods, this approach effectively addresses the issue of overly uniform and rigid ...
The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, and ...
Application of genetic algorithms to optimal tailoring of composite materials Composite materials tailoring refers to the concurrent manipulation of the materials composition and internal architecture to achieve the desired propertie... D Sadagopan,R Pitchumani - 《Composites Science & Technology》 被引量:...
In this paper we introduce an application of genetic algorithms (GAs) with the problem of drawing of level planar graph or hierarchical planar graph, and e... MA El-Sayed,Nahla F. A. Omran 被引量: 0发表: 2013年 An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs...
As stated in the Introduction, it seems that most researchers "modified" their implementations of genetic algorithms either by using non-standard chromosome representation or by designing problem-specific genetic operators (e.g., [104], [294], [48], [56], etc.) to accommodate the problem to...
3.The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, an...
LayoutShow is a Java-based multi-threaded applet/application for experimentation with graph drawing algorithms, particularly, force-directed algorithms. The motivation behind the development of this s L Behzadi 被引量: 8发表: 1999年 Drawing of layout documentation as the basis of logistics management...
The algorithm transforms the problem of planar graph drawing to that of constraint optimization, and constructs a function with constraints according to the aesthetic criteria of graph drawing problem, and then uses genetic algorithms to find approximate optimal solutions to the objective function, and ...