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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer graphics forum Ročník 31; číslo 3pt1; s. 865 - 874
Hlavní autoři: Hurter, C., Ersoy, O., Telea, A.
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Oxford, UK Blackwell Publishing Ltd 01.06.2012
Wiley
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:istex:3D9DCDA288F3DA4A6AFCB9EB401BB752F10820DB
ArticleID:CGF3079
ark:/67375/WNG-0WT09HTP-9
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2012.03079.x