Graph bundling by Kernel Density Estimation

Christophe Hurter (1) , Ozan Ersoy (2) , Alexandru C Telea (2)

1 LII - ENAC - Equipe Informatique Interactive
2 University of Groningen [Groningen]

We present a fast and simple method to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. Our technique can be easily and efficiently implemented using standard graphics acceleration techniques and produces graph bundlings of similar appearance and quality to state-of-the-art methods at a fraction of the cost. Additionally, we show how to create bundled layouts constrained by obstacles and use shading to convey information on the bundling quality. We demonstrate our method on several large graphs.

Mots clés: ghraph layouts; edge bundles; image-based information visualization

Domaines: Interface homme-machine [cs.HC]

Christophe Hurter, Ozan Ersoy, Alexandru C Telea. Graph bundling by Kernel Density Estimation. EUROVIS 2012, Eurographics Conference on Visualization, Jun 2012, Vienna, Austria. pp 865-874, ⟨10.1111/j.1467-8659.2012.03079.x⟩. ⟨hal-01022472⟩