Graph Bundling by Kernel Density Estimation

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...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 31; no. 3pt1; pp. 865 - 874
Main Authors:	Hurter, C., Ersoy, O., Telea, A.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.06.2012 Wiley
Subjects:	Acceleration Analysis Bundling Computer graphics Computer Science Density edge bundles Graph layouts Graph theory Graphs Human-Computer Interaction I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation image-based information visualization Kernels Maxima Obstacles Studies image-based information visualization edge bundles ghraph layouts
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!