Winding Roads: Routing edges into bundles

Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of edges and their crossings. Consequently it is difficult to read the relationships between nodes and the high‐level edge pat...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 29; no. 3; pp. 853 - 862
Main Authors: Lambert, A., Bourqui, R., Auber, D.
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.06.2010
Wiley
Subjects:
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of edges and their crossings. Consequently it is difficult to read the relationships between nodes and the high‐level edge patterns that may exist in standard node‐link diagram representations. Edge bundling techniques have been proposed to help solve this issue, which rely on high quality edge rerouting. In this paper, we introduce an intuitive edge bundling technique which efficiently reduces edge clutter in graphs drawings. Our method is based on the use of a grid built using the original graph to compute the edge rerouting. In comparison with previously proposed edge bundling methods, our technique improves both the level of clutter reduction and the computation performance. The second contribution of this paper is a GPU‐based rendering method which helps users perceive bundles densities while preserving edge color.
Bibliography:ArticleID:CGF1700
ark:/67375/WNG-7N7R86LN-0
istex:E77DE5BC0FF8ABFBE1005DF6682DF2EFFC5B2B02
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2009.01700.x