The Community for Technology Leaders
Green Image
Issue No. 06 - June (2013 vol. 19)
ISSN: 1077-2626
pp: 953-966
M. E. Belviranli , Dept. of Comput. Sci. & Eng., Univ. of California, Riverside, Riverside, CA, USA
A. Dilek , TUBITAK-BILGEM, Sci. & Technol. Res. Council of Turkey, Ankara, Turkey
U. Dogrusoz , Dept. of Comput. Eng., Bilkent Univ., Ankara, Turkey
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 embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio.
Layout, Clustering algorithms, Springs, Force, Algorithm design and analysis, Software algorithms, Data visualization, sequence alignment, Information visualization, visualization techniques and methodologies, visualization systems and software, graph algorithms, algorithm design and analysis, graph visualization, graph drawing, force-directed layout, circular layout, clustered graphs
M. E. Belviranli, A. Dilek, U. Dogrusoz, "CiSE: A Circular Spring Embedder Layout Algorithm", IEEE Transactions on Visualization & Computer Graphics, vol. 19, no. , pp. 953-966, June 2013, doi:10.1109/TVCG.2012.178
176 ms
(Ver 3.3 (11022016))