Yönsüz bileşik çizgiler için yerleşim algoritması

ABSTRACTA LAYOUT ALGORITHM FORUNDIRECTED COMPOUND GRAPHSErhan GiralM.S. in Computer EngineeringSupervisor: Assist. Prof. Dr. Uğur Doğrusüzg goAugust, 2005Graph layout is an important problem in information visualization. All data-driven graph-based information visualization systems require some sort of anautomatic geometry generation mechanism, as it is generally not directly availablefrom the data being modeled. This is why graph layout problem has been studiedextensively. However, for the case of compound graphs, there are still importantgaps in this area. We present a new, elegant algorithm for undirected compoundgraph layout. The algorithm is based on the traditional force-directed layoutscheme with extensions to handle nesting, varying node sizes, and possibly otherapplication-specific constraints. Experimental results show that the executiontime and quality of the produced drawings with respect to commonly acceptedlayout criteria are quite satisfactory. The algorithm has also been successfullyimplemented as part of a pathway integration and analysis toolkit named Patikafor drawing complicated biological pathways with compartmental constraints andarbitrary nesting relations to represent molecular complexes and various types ofpathway abstractions.Keywords: Visualization, Graph Visualization, Graph Drawing, Force DirectedGraph Layout, Compound Graphs.i