Winding Roads: Routing edges into bundles - Archive ouverte HAL Access content directly
Journal Articles Computer Graphics Forum Year : 2010

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 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.


Other [cs.OH]
Fichier principal
Vignette du fichier
Winding_Roads_Eurovis2010.pdf (4.49 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00495279 , version 1 (25-06-2010)


  • HAL Id : hal-00495279 , version 1


Antoine Lambert, Romain Bourqui, David Auber. Winding Roads: Routing edges into bundles. Computer Graphics Forum, 2010, 29 (3), pp.853-862. ⟨hal-00495279⟩
272 View
1198 Download


Gmail Facebook X LinkedIn More