The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.19)
pp: 953-966
U. Dogrusoz , Dept. of Comput. Eng., Bilkent Univ., Ankara, Turkey
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
ABSTRACT
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.
INDEX TERMS
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
CITATION
U. Dogrusoz, M. E. Belviranli, A. Dilek, "CiSE: A Circular Spring Embedder Layout Algorithm", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 6, pp. 953-966, June 2013, doi:10.1109/TVCG.2012.178
REFERENCES
[1] G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society," Nature, vol. 435, pp. 814-818, 2005.
[2] U. Dogrusoz, Q. Feng, B. Madden, M. Doorley, and A. Frick, "Graph Visualization Toolkits," IEEE Computer Graphics and Applications, vol. 22, no. 1, pp. 30-37, Jan./Feb. 2002.
[3] U. Dogrusoz, B. Madden, and P. Madden, "Circular Layout in the Graph Layout Toolkit," Proc. Symp. Graph Drawing (GD '96), S. North ed., pp. 92-100, 1997.
[4] J.M. Six and I.G. Tollis, "A Framework for User-Grouped Circular Drawings," Proc. 11th Symp. Graph Drawing (GD '03), G. Liotta, ed., pp. 135-146, 2004.
[5] Q. Feng, R. Cohen, and P. Eades, "Planarity for Clustered Graphs," Proc. Third Ann. European Symp. Algorithms (ESA '95), P. Spirakis, ed., pp. 213-226, 1995.
[6] K. Sugiyama and K. Misue, "Visualization of Structural Information: Automatic Drawing of Compound Digraphs," IEEE Trans. Systems, Man and Cybernetics, vol. 21, no. 4, pp. 876-892, July/Aug. 1991.
[7] X. Wang and I. Miyamoto, "Generating Customized Layouts," Proc. Second Int'l Symp. Graph Drawing (Proc. GD '95), F. Brandenburg, ed., pp. 504-515, 1995.
[8] Drawing Graphs: Methods and Models, M. Kaufmann, and D. Wagner eds. Springer, 2001.
[9] J.M. Six and I.G. Tollis, "A Framework and Algorithms for Circular Drawings of Graphs," J. Discrete Algorithms, vol. 4, no. 1, pp. 25-50, 2006.
[10] H. He and O. Skora, "New Circular Drawing Algorithms," Proc. Workshop Information Technologies - Applications and Theory (ITAT '04), 2004.
[11] M. Baur and U. Brandes, "Crossing Reduction in Circular Layouts," Proc. 30th Int'l Workshop Graph-Theoretic Concepts in Computer-Science (WG '04), pp. 332-343, 2004.
[12] E.R. Gansner and Y. Koren, "Improved Circular Layouts," Proc. 14th Int'l Conf. Graph Drawing, pp. 386-398, 2006.
[13] M. Baur and U. Brandes, "Multi-Circular Layout of Micro/Macro Graphs," Proc. 15th Int'l Conf. Graph Drawing, pp. 255-267, 2007.
[14] M. Kaufmann and R. Wiese, "Maintaining the Mental Map for Circular Drawings," Proc. 10th Int'l Symp. Graph Drawing, pp. 12-22, 2002.
[15] U. Brandes, "Drawing on Physical Analogies," Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds., pp. 71-86, Springer,, 2001.
[16] U. Dogrusoz, E. Giral, A. Cetintas, A. Civril, and E. Demir, "A Layout Algorithm for Undirected Compound Graphs," Information Sciences, vol. 179, pp. 980-994, 2009.
[17] D. Harel and Y. Koren, "Drawing Graphs with Non-Uniform Vertices," Proc. Working Conf. Advanced Visual Interfaces (Proc. AVI '02), pp. 157-166, 2002.
[18] T.M.J. Fruchterman and E.M. Reingold, "Graph Drawing by Force-Directed Placement," Software Practice and Experience, vol. 21, no. 11, pp. 1129-1164, 1991.
[19] A. Mosig, I.L. Hofacker, and P.F. Stadler, "Comparative Analysis of Cyclic Sequences: Viroids and Other Small Circular Rnas," Proc. German Conf. Bioinformatics, pp. 93-102, 2006.
[20] M.E.J. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks," Physical Rev., vol. E 69, no. 026113, 2004.
[21] S.B. Needleman and C.D. Wunsch, "A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins," J. Molecular Biology, vol. 48, no. 3, pp. 443-453, 1970.
[22] U. Dogrusoz and B. Genc, "A Multi-Graph Approach to Complexity Management in Interactive Graph Visualization," Computers & Graphics, vol. 30, no. 1, pp. 86-97, 2006.
[23] G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing, Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool