Ambiguity-free edge-bundling for interactive graph visualization

Sheng Jie Luo, Chun Liang Liu, Bing Yu Chen, Kwan-Liu Ma

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.

Original languageEnglish (US)
Article number5887331
Pages (from-to)810-821
Number of pages12
JournalIEEE Transactions on Visualization and Computer Graphics
Volume18
Issue number5
DOIs
StatePublished - Jan 16 2012

Fingerprint

Visualization
Display devices

Keywords

  • detail-on-demand
  • edge ambiguity
  • edge bundling
  • edge congestion
  • Graph visualization
  • interactive navigation
  • network visualization

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

Ambiguity-free edge-bundling for interactive graph visualization. / Luo, Sheng Jie; Liu, Chun Liang; Chen, Bing Yu; Ma, Kwan-Liu.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 18, No. 5, 5887331, 16.01.2012, p. 810-821.

Research output: Contribution to journalArticle

Luo, Sheng Jie ; Liu, Chun Liang ; Chen, Bing Yu ; Ma, Kwan-Liu. / Ambiguity-free edge-bundling for interactive graph visualization. In: IEEE Transactions on Visualization and Computer Graphics. 2012 ; Vol. 18, No. 5. pp. 810-821.
@article{7fff0dff3802470f9544f9071926239f,
title = "Ambiguity-free edge-bundling for interactive graph visualization",
abstract = "Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.",
keywords = "detail-on-demand, edge ambiguity, edge bundling, edge congestion, Graph visualization, interactive navigation, network visualization",
author = "Luo, {Sheng Jie} and Liu, {Chun Liang} and Chen, {Bing Yu} and Kwan-Liu Ma",
year = "2012",
month = "1",
day = "16",
doi = "10.1109/TVCG.2011.104",
language = "English (US)",
volume = "18",
pages = "810--821",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Ambiguity-free edge-bundling for interactive graph visualization

AU - Luo, Sheng Jie

AU - Liu, Chun Liang

AU - Chen, Bing Yu

AU - Ma, Kwan-Liu

PY - 2012/1/16

Y1 - 2012/1/16

N2 - Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.

AB - Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.

KW - detail-on-demand

KW - edge ambiguity

KW - edge bundling

KW - edge congestion

KW - Graph visualization

KW - interactive navigation

KW - network visualization

UR - http://www.scopus.com/inward/record.url?scp=84862797112&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862797112&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2011.104

DO - 10.1109/TVCG.2011.104

M3 - Article

VL - 18

SP - 810

EP - 821

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 5

M1 - 5887331

ER -