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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-01022472
Contributor : Laurence Porte <>
Submitted on : Monday, July 21, 2014 - 2:55:02 PM
Last modification on : Thursday, February 7, 2019 - 5:14:59 PM
Long-term archiving on : Thursday, November 20, 2014 - 6:12:07 PM

File

350.pdf
Files produced by the author(s)

Identifiers

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. pp 865-874, ⟨10.1111/j.1467-8659.2012.03079.x⟩. ⟨hal-01022472⟩

Share

Metrics

Record views

252

Files downloads

1092