Convergent drawing for mutually connected directed graphs. (December 2017)

• Record Type: Journal Article
• Authors: Toeda, Naoko; Nakazawa, Rina; Itoh, Takayuki; Saito, Takafumi; Archambault, Daniel
• Is Part Of: Journal of visual languages & computing. Volume 43(2017)
• Page Start: 83
• Page End: 90
• Publication Date: 2017-12
• Subjects: Directed graph -- Edge bundling -- Node layout -- Graph clustering; Visual programming languages (Computer science) -- Periodicals; Visual programming (Computer science) -- Periodicals; Programming languages (Electronic computers) -- Semantics -- Periodicals; Langages de programmation visuelle -- Périodiques; Programmation visuelle -- Périodiques; Langages de programmation -- Sémantique -- Périodiques; Programming languages (Electronic computers) -- Semantics; Visual programming (Computer science); Visual programming languages (Computer science); Periodicals; Electronic journals; 005
• DOI: 10.1016/j.jvlc.2017.09.004
• Languages: English
• ISSNs: 1045-926X

Abstract

Abstract: Directed graphs are used to represent a variety of datasets, including friendship on social networking services (SNS), pathways of genes, and citations of research papers. Graph drawing is useful in representing such datasets. At the international conference on Information Visualization (IV), we have presented a convergent edge drawing and a node layout technique for tightly and mutually connected directed graphs. The edge drawing technique in the IV paper includes three features: ordinary bundling of edges connecting pairs of node clusters, convergence of multiple bundles that connect to the same node cluster, and shape adjustment of two bundles connecting the same pair of node clusters. In this paper, we present improved node layout and edge drawing techniques, which make our edge bundling more effective. This paper also introduces a case study with a directed paper citation graph dataset.vvvvv