Uncluttering graph layouts using anisotropic diffusion and mass transport

Many graph layouts include very dense areas, making the layout difficult to understand. In this paper, we propose a technique for modifying an existing layout in order to reduce the clutter in dense areas. A physically inspired evolution process based on a modified heat equation is used to create an...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1998. - 15(2009), 5 vom: 25. Sept., Seite 777-88
1. Verfasser: Frishman, Yaniv (VerfasserIn)
Weitere Verfasser: Tal, Ayellet
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2009
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000caa a22002652 4500
001 NLM189880899
003 DE-627
005 20250210141634.0
007 cr uuu---uuuuu
008 231223s2009 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2009.55  |2 doi 
028 5 2 |a pubmed25n0633.xml 
035 |a (DE-627)NLM189880899 
035 |a (NLM)19590104 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Frishman, Yaniv  |e verfasserin  |4 aut 
245 1 0 |a Uncluttering graph layouts using anisotropic diffusion and mass transport 
264 1 |c 2009 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 17.09.2009 
500 |a Date Revised 10.07.2009 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Many graph layouts include very dense areas, making the layout difficult to understand. In this paper, we propose a technique for modifying an existing layout in order to reduce the clutter in dense areas. A physically inspired evolution process based on a modified heat equation is used to create an improved layout density image, making better use of available screen space. Using results from optimal mass transport problems, a warp to the improved density image is computed. The graph nodes are displaced according to the warp. The warp maintains the overall structure of the graph, thus limiting disturbances to the mental map, while reducing the clutter in dense areas of the layout. The complexity of the algorithm depends mainly on the resolution of the image visualizing the graph and is linear in the size of the graph. This allows scaling the computation according to required running times. It is demonstrated how the algorithm can be significantly accelerated using a graphics processing unit (GPU), resulting in the ability to handle large graphs in a matter of seconds. Results on several layout algorithms and applications are demonstrated 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Tal, Ayellet  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1998  |g 15(2009), 5 vom: 25. Sept., Seite 777-88  |w (DE-627)NLM098269445  |x 1077-2626  |7 nnns 
773 1 8 |g volume:15  |g year:2009  |g number:5  |g day:25  |g month:09  |g pages:777-88 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2009.55  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 15  |j 2009  |e 5  |b 25  |c 09  |h 777-88