Graph bundling by Kernel Density Estimation

Abstract : 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.
Type de document :
Communication dans un congrès
EUROVIS 2012, Eurographics Conference on Visualization, Jun 2012, Vienna, Austria. 31 (3), pp 865-874, 2012, 〈10.1111/j.1467-8659.2012.03079.x〉
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

https://hal-enac.archives-ouvertes.fr/hal-01022472
Contributeur : Laurence Porte <>
Soumis le : lundi 21 juillet 2014 - 14:55:02
Dernière modification le : mardi 30 janvier 2018 - 14:06:02
Document(s) archivé(s) le : jeudi 20 novembre 2014 - 18:12:07

Fichier

350.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

LII | ENAC

Citation

Christophe Hurter, Ozan Ersoy, Alexandru Telea. Graph bundling by Kernel Density Estimation. EUROVIS 2012, Eurographics Conference on Visualization, Jun 2012, Vienna, Austria. 31 (3), pp 865-874, 2012, 〈10.1111/j.1467-8659.2012.03079.x〉. 〈hal-01022472〉

Partager

Métriques

Consultations de la notice

217

Téléchargements de fichiers

822