Graph Bundling by Kernel Density Estimation

Simple item page
dc.contributor.authorHurter, Christopheen_US
dc.contributor.authorErsoy, Ozanen_US
dc.contributor.authorTelea, Alexen_US
dc.contributor.editorS. Bruckner, S. Miksch, and H. Pfisteren_US
dc.date.accessioned2015-02-28T07:01:39Z
dc.date.available2015-02-28T07:01:39Z
dc.date.issued2012en_US
dc.description.abstractWe 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.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume31
dc.identifier.doi10.1111/j.1467-8659.2012.03079.x
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2012.03079.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleGraph Bundling by Kernel Density Estimationen_US
Files
Collections
31-Issue 3
EuroVis12: Eurographics Conference on Visualization