Parallel edge splatting for scalable dynamic graph visualization

© 2011 IEEE

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 17(2011), 12 vom: 01. Dez., Seite 2344-53
1. Verfasser: Burch, Michael (VerfasserIn)
Weitere Verfasser: Vehlow, Corinna, Beck, Fabian, Diehl, Stephan, Weiskopf, Daniel
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM212567969
003 DE-627
005 20231224015804.0
007 cr uuu---uuuuu
008 231224s2011 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2011.226  |2 doi 
028 5 2 |a pubmed24n0708.xml 
035 |a (DE-627)NLM212567969 
035 |a (NLM)22034355 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Burch, Michael  |e verfasserin  |4 aut 
245 1 0 |a Parallel edge splatting for scalable dynamic graph visualization 
264 1 |c 2011 
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 24.02.2012 
500 |a Date Revised 24.04.2012 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a © 2011 IEEE 
520 |a We present a novel dynamic graph visualization technique based on node-link diagrams. The graphs are drawn side-byside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edges to a pixel-based scalar field. This field represents the edge densities in a scalable way and is depicted by non-linear color mapping. The visualization method is complemented by interaction techniques that support data exploration by aggregation, filtering, brushing, and selective data zooming. Furthermore, we formalize graph patterns so that they can be interactively highlighted on demand. A case study on software releases explores the evolution of call graphs extracted from the JUnit open source software project. In a second application, we demonstrate the scalability of our approach by applying it to a bibliography dataset containing more than 1.5 million paper titles from 60 years of research history producing a vast amount of relations between title words 
650 4 |a Journal Article 
700 1 |a Vehlow, Corinna  |e verfasserin  |4 aut 
700 1 |a Beck, Fabian  |e verfasserin  |4 aut 
700 1 |a Diehl, Stephan  |e verfasserin  |4 aut 
700 1 |a Weiskopf, Daniel  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 17(2011), 12 vom: 01. Dez., Seite 2344-53  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:17  |g year:2011  |g number:12  |g day:01  |g month:12  |g pages:2344-53 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2011.226  |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 17  |j 2011  |e 12  |b 01  |c 12  |h 2344-53