Ambiguity-free edge-bundling for interactive graph visualization

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

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


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
Issue number5
StatePublished - Jan 16 2012


  • 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


Dive into the research topics of 'Ambiguity-free edge-bundling for interactive graph visualization'. Together they form a unique fingerprint.

Cite this