Visualizing big graphs with labels through edge bundling

Wu Quan Wang, Zhuang Cai, Kang Zhang

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

1 Citation (Scopus)

Abstract

Graphs depicted as node-link diagrams are widely used in visualizing relational data sets. Visual clutter becomes problematic with big node-link diagrams. Researchers have recently proposed various approaches to bundling edges to reduce visual clutter. None of the edge bundling approaches, however, addresses the issue of labeling in the visualized graph. This paper presents an approach to bundling edges of big graphs, possibly over geographical maps with location labels such as cities and states. Our approach routes edges via flexible control points to leave space for labels to be clearly visible. We demonstrate the effectiveness of our approach on two commonly used datasets.

Original languageEnglish
Title of host publicationProceedings of 2016 IEEE International Conference on Big Data Analysis, ICBDA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467395908
DOIs
Publication statusPublished - 12 Jul 2016
Externally publishedYes
Event2016 IEEE International Conference on Big Data Analysis, ICBDA 2016 - Hangzhou, China
Duration: 12 Mar 201614 Mar 2016

Publication series

NameProceedings of 2016 IEEE International Conference on Big Data Analysis, ICBDA 2016

Conference

Conference2016 IEEE International Conference on Big Data Analysis, ICBDA 2016
Country/TerritoryChina
CityHangzhou
Period12/03/1614/03/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

  • big graph
  • clutter reduction
  • edge bundling
  • information visualisation
  • labeled map

Fingerprint

Dive into the research topics of 'Visualizing big graphs with labels through edge bundling'. Together they form a unique fingerprint.

Cite this