Winding Roads: Routing edges into bundles

Simple item page
dc.contributor.authorLambert, Antoineen_US
dc.contributor.authorBourqui, Romainen_US
dc.contributor.authorAuber, Daviden_US
dc.contributor.editorG. Melancon, T. Munzner, and D. Weiskopfen_US
dc.date.accessioned2014-02-21T20:05:51Z
dc.date.available2014-02-21T20:05:51Z
dc.date.issued2010en_US
dc.description.abstractVisualizing 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 nodelink 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01700.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01700.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleWinding Roads: Routing edges into bundlesen_US
Files
Collections
29-Issue 3
EuroVis10: Eurographics/ IEEE Symposium on Visualization