Show simple item record

dc.contributor.authorFrishman, Yaniven_US
dc.contributor.authorTal, Ayelleten_US
dc.contributor.editorK. Museth and T. Moeller and A. Ynnermanen_US
dc.date.accessioned2014-01-31T07:10:59Z
dc.date.available2014-01-31T07:10:59Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905673-45-6en_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttp://dx.doi.org/10.2312/VisSym/EuroVis07/075-082en_US
dc.description.abstractThis paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 8 compared to the CPU implementation. An application to visualization of discussion threads in Internet sites is provided.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.8 [Computer graphics]: Applications H.4.3 [Information systems applications]: Communications applicationsen_US
dc.titleOnline Dynamic Graph Drawingen_US
dc.description.seriesinformationEurographics/ IEEE-VGTC Symposium on Visualizationen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record