Filters








8,297 Hits in 6.6 sec

A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations

M. Ghoniem, J.-D. Fekete, P. Castagliola
IEEE Symposium on Information Visualization  
In this paper, we describe a taxonomy of generic graph related tasks and an evaluation aiming at assessing the readability of two representations of graphs: matrix-based representations and nodelink diagrams  ...  For instance, we show that when graphs are bigger than twenty vertices, the matrix-based visualization performs better than node-link diagrams on most tasks.  ...  We are grateful to the users who volunteered and took part in this evaluation and to the members of the RNTL OADYMPPAC project.  ... 
doi:10.1109/infvis.2004.1 dblp:conf/infovis/GhoniemFC04 fatcat:bunsbctmpbfqxbmghy3bo7jr4i

Matrices or Node-Link Diagrams: Which Visual Representation is Better for Visualising Connectivity Models?

René Keller, Claudia M. Eckert, P. John Clarkson
2006 Information Visualization  
This study widens the scope of readability comparisons between node-link and matrix-based representations by introducing new user tasks and replacing simulated, undirected graphs with directed ones employing  ...  However, outside this community, DSMs (and other matrix-based representations of graphs) are rarely applied and node-link diagrams are very popular.  ...  We thank Tomás Flanagan and Felix Ballestrem for their contributions to this paper.  ... 
doi:10.1057/palgrave.ivs.9500116 fatcat:lskiicrcizhfpmb4usze3ddgmm

Towards an Aesthetic Dimensions Framework for Dynamic Graph Visualisations

Fabian Beck, Michael Burch, Stephan Diehl
2009 2009 13th International Conference Information Visualisation  
Most research on the readability of graph visualisation focuses on node-link diagrams of static graphs.  ...  In this paper we look at dynamic graph visualisations: We translate the general goal of graph visualisation-to convey the underlying information of a graph-into aesthetic dimensions that are applicable  ...  The case study showed the usefulness of these criteria by comparing three recently developed dynamic graph visualisations. Differences and similarities clearly emerged on the different dimensions.  ... 
doi:10.1109/iv.2009.42 dblp:conf/iv/BeckBD09 fatcat:m42ji6mexnffffctbublwex2lq

Visual Analysis of Large Graphs [article]

T. Von Landesberger, A. Kuijper, T. Schreck, J. Kohlhammer, J. J. Van Wijk, J.-D. Fekete, D. W. Fellner
2010 Eurographics State of the Art Reports  
The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas.  ...  As an important component of visual graph analysis, we discuss various graph algorithmic aspects useful for the different stages of the visual graph analysis process.  ...  Acknowledgements We thank Vyara Ivanova, Anna Mitkova, Melanie Goerner, and Robert Rehner for their useful comments and suggestions.  ... 
doi:10.2312/egst.20101061 fatcat:msw7dtkfvvffrntt3lz246nylm

Visually Exploring Large Social Networks [chapter]

Nathalie Henry
2007 Lecture Notes in Computer Science  
Research Area and Topic. Information Visualization and Human Computer Interaction. This PhD focuses on visualization and interaction to navigate, explore and present large social networks.  ...  Matrix and node-link representations Fig. 2 . 2 Fig. 2.  ...  Systems such as SocialAction [7] start the analysis with a node-link diagram of the full graph.  ... 
doi:10.1007/978-3-540-74800-7_59 fatcat:4g4k5ygsnvawpcdtkjnbtoovmq

Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges

T. von Landesberger, A. Kuijper, T. Schreck, J. Kohlhammer, J.J. van Wijk, J.-D. Fekete, D.W. Fellner
2011 Computer graphics forum (Print)  
How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analyticaltask at hand and the applicability of graph analysis methods.  ...  Recently, new techniques have been developed covering a broader range of graph types, such as timevarying graphs.  ...  We are grateful to the anonymous reviewers for their constructive and useful comments.  ... 
doi:10.1111/j.1467-8659.2011.01898.x fatcat:qgldplci3bbwtbhd7rys5m4osu

Improving the Readability of Clustered Social Networks using Node Duplication

N. Henr, A. Bezerianos, J.-D. Fekete
2008 IEEE Transactions on Visualization and Computer Graphics  
Several visual duplication designs are discussed and a controlled experiment comparing network visualization with and without duplication is performed, using 6 tasks that are important for graph readability  ...  Finally, we propose a set of guidelines for deciding when to duplicate actors and choosing candidates for duplication, and alternative ways to render them in social network representations.  ...  ACKNOWLEDGEMENTS This work was supported in part by the joint Microsoft-Research/INRIA ReActivity Project.  ... 
doi:10.1109/tvcg.2008.141 pmid:18988979 fatcat:jtzkq5eo2nci7dnx6a4fjrbupq

TimeSpiderTrees: A Novel Visual Metaphor for Dynamic Compound Graphs

Michael Burch, Michael Fritz, Fabian Beck, Stephan Diehl
2010 2010 IEEE Symposium on Visual Languages and Human-Centric Computing  
The most common metaphor to visualize graphs is the node-link technique, which typically suffers from visual clutter caused by many edge crossings.  ...  Much research has been done on the development of sophisticated algorithms aimed at enhancing the layout with respect to edge crossings and a series of other aesthetic criteria.  ...  Nevertheless, a matrix-based representation is problematic when it comes to visualizing sequences of graphs in a single view.  ... 
doi:10.1109/vlhcc.2010.31 dblp:conf/vl/BurchFBD10 fatcat:a3aljtfzczgbbgua52ecgzaeuy

Towards a Survey on Static and Dynamic Hypergraph Visualizations [article]

Maximilian T. Fischer, Alexander Frings, Daniel A. Keim, Daniel Seebacher
2021 arXiv   pre-print
structures, including a recent demand for a temporal representation of interaction networks and their improvements beyond graph-based methods.  ...  Hypergraph models can provide a more accurate representation of the underlying processes while reducing the overall number of links compared to regular representations.  ...  ACKNOWLEDGMENTS The authors acknowledge the financial support by the Federal Ministry of Education and Research of Germany (BMBF) in the framework of PEGASUS under the program "Forschung für die zivile  ... 
arXiv:2107.13936v1 fatcat:vmme4ufgcze4lcxvuhn4xor3pq

Towards a Survey on Static and Dynamic Hypergraph Visualizations

Maximilian T. Fischer, Alexander Frings, Daniel A. Keim, Daniel Seebacher
2021 2021 IEEE Visualization Conference (VIS)  
structures, including a recent demand for a temporal representation of interaction networks and their improvements beyond graph-based methods.  ...  Hypergraph models can provide a more accurate representation of the underlying processes while reducing the overall number of links compared to regular representations.  ...  ACKNOWLEDGMENTS The authors acknowledge the financial support by the Federal Ministry of Education and Research of Germany (BMBF) in the framework of PEGASUS under the program "Forschung für die zivile  ... 
doi:10.1109/vis49827.2021.9623305 fatcat:7r6tflk7urdshcahv75vfjfteq

Weighted graph comparison techniques for brain connectivity analysis

Basak Alper, Benjamin Bach, Nathalie Henry Riche, Tobias Isenberg, Jean-Daniel Fekete
2013 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems - CHI '13  
We explored the design space of applicable visual representations and present augmented adjacency matrix and node-link visualizations.  ...  The analysis of brain connectivity is a vast field in neuroscience with a frequent use of visual representations and an increasing need for visual analysis tools.  ...  Kayo Inoue from The Integrated Brain Imaging Center (IBIC) at University of Washington, and to Dr. Arjun Bansal from Harvard Medical School for their valuable input that went into this work.  ... 
doi:10.1145/2470654.2470724 dblp:conf/chi/AlperBRIF13 fatcat:3mcxu5dvcfd3lkoaqmg4ckxc34

Design and implementation of small multiples matrix-based visualisation to monitor and compare email socio-organisational relationships

Mithileysh Sathiyanarayanan, Cagatay Turkay, Odunayo Fadahunsi
2018 2018 10th International Conference on Communication Systems & Networks (COMSNETS)  
ACKNOWLEDGMENT We would like to thank Rahul Powar and Randal Pinto of Red Sift Research for their insightful comments and enlightening us with their corporate knowledge and supporting us by funding.  ...  We would also like to thank people from the giCentre, City, University of London, UK for their timely guidance.  ...  The email network can be visualized in terms of a node-link diagram to understand relationships information using nodes and links.  ... 
doi:10.1109/comsnets.2018.8328288 dblp:conf/comsnets/Sathiyanarayanan18 fatcat:sptzmvfq4fgsbed3x2t3una3ke

Visual comparison of software architectures

Fabian Beck, Stephan Diehl
2012 Information Visualization  
We present a novel visualization technique to compare architectures based on the decomposition of the software system and on the dependencies among the code entities.  ...  Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions.  ...  We preferred a matrix representation over a node-link approach-diagrams where nodes represent code entities and visual links between these nodes represent dependenciesfor several reasons: Scalability Node-link  ... 
doi:10.1177/1473871612455983 fatcat:g4swpma5lnchjc2ekqadpowi2e

Visual comparison of software architectures

Fabian Beck, Stephan Diehl
2010 Proceedings of the 5th international symposium on Software visualization - SOFTVIS '10  
We present a novel visualization technique to compare architectures based on the decomposition of the software system and on the dependencies among the code entities.  ...  Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions.  ...  We preferred a matrix representation over a node-link approach-diagrams where nodes represent code entities and visual links between these nodes represent dependenciesfor several reasons: Scalability Node-link  ... 
doi:10.1145/1879211.1879238 dblp:conf/softvis/BeckD10 fatcat:koayud7kkrhu7hmn356nr6zai4

A dynamic graph visualization perspective on eye movement data

Michael Burch, Fabian Beck, Michael Raschke, Tanja Blascheck, Daniel Weiskopf
2014 Proceedings of the Symposium on Eye Tracking Research and Applications - ETRA '14  
We show that existing dynamic graph visualizations can be used to display the transformed data and illustrate the approach by applying it to eye tracking data recorded for investigating the readability  ...  (c) Dynamic graph visualization can be used as alternative visualization technique to analyze time-varying patterns and relations between fixation points or Areas of Interest (AOIs).  ...  Figure 7 : Eye movement data for the stimulus depicted in Figure 6 visualized as a node-link and matrix timeline-based representation.  ... 
doi:10.1145/2578153.2578175 dblp:conf/etra/BurchBRBW14 fatcat:rnpu5ykhn5gobbbqfdyzl5xjze
« Previous Showing results 1 — 15 out of 8,297 results