A circular layout algorithm for clustered graphs
Belviranlı, Mehmet Esat
Item Usage Stats
MetadataShow full item record
Visualization of information is essential for comprehension and analysis of the acquired data in any field of study. Graph layout is an important problem in information visualization and plays a crucial role in the drawing of graph-based data. There are many styles and ways to draw a graph depending on the type of the data. Clustered graph visualization is one popular aspect of the graph layout problem and there have been many studies on it. However, only a few of them focus on using circular layout to represent clusters. We present a new, elegant algorithm for layout of clustered graphs using a circular style. The algorithm is based on traditional force-directed layout scheme and uses circles to draw each cluster in the graph. In addition it can handle non-uniform node dimensions. It is the first algorithm to properly address layout of the quotient graph while considering inter-cluster relations as well as intra-cluster edge crossings. 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 been successfully implemented as part of Chisio, version 1.1. Chisio is an open source general purpose graph editor developed by i-Vis (information visualization) Research Group of Bilkent University.
Force Directed Graph Layout
Circular Graph Layout
T385 .B45 2009
Showing items related by title, author, creator and subject.
Akbudak K.; Aykanat, C. (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 ...
Dogrusoz, U.; Belviranli, M. E.; Dilek, A. (Institute of Electrical and Electronics Engineers, 2013)We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring ...
Eser, E.; Kocayusufoglu, F.; Eravci, B.; Ferhatosmanoglu, H.; Larriba-Pey, J. L. (IEEE Computer Society, 2017)While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from ...