A layout algorithm for undirected compound graphs
980 - 994
Item Usage Stats
We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions. © 2008 Elsevier Inc. All rights reserved.
Force-directed graph layout
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.ins.2008.11.017
Showing items related by title, author, creator and subject.
Akbudak K.; Aykanat, Cevdet (IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
Okka, Alihan; Doğrusöz, Uğur; Balcı, Hasan (Sage Publications, 2021-07-01)This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional ...
Okka, Alihan (Bilkent University, 2020-10)Information visualization is a eld of study that aims to represent abstract data in an aesthetically pleasing and easy to comprehend visual manner. Various approaches and standards have been created to reinforce the ...