Hybrid GA for Straight-Line Drawings of Level Clustered Planar Graphs
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 explore the potential use of GAs to
solve this particular problem. Given a level planar graph, we
want to find a geometric position of every vertex (layout) in a
straight-line grid drawing without any edge-intersection. Here we
introduce a simple hybrid GA, which nicely draws level planar
graph of moderate size. The paper shows that the GAs can help
find an layout of levels and hierarchical planar graphs without
any crossing edges.
Keywords: Genetic algorithms, graph drawing, hierarchical graphs, level graph, clustered graph
Download Full-Text
