Experiments and a User Study for Hierarchical Drawings of Graphs
Open Access
- 29 May 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 55618-55629
Abstract
We present a detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF) . Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction. We present experimental results and a user study for hierarchical drawings of graphs that show the usefulness of the new drawing technique. The drawings produced by the new framework are compared to drawings produced by the well known Sugiyama framework in terms of area, number of bends, number of crossings, and execution time. The new algorithm runs very fast and produces drawings that are readable and more efficient in terms of area and number of bends. Furthermore, since there are advantages (and disadvantages) to both frameworks, we performed a user study. The results show that the drawings produced by the new framework are well received in terms of clarity, readability, and usability. Hence, the new technique offers an interesting alternative to drawing hierarchical graphs, and is especially useful in applications where user defined paths are important and need to be highlighted.Keywords
All Related Versions
Funding Information
- University of Crete and the publication of the article in OA mode
This publication has 20 references indexed in Scilit:
- Exploring Complex Drawings via Edge Stratification2013
- Empirical Studies in Information Visualization: Seven ScenariosIEEE Transactions on Visualization and Computer Graphics, 2011
- Creation and Collaboration: Engaging New Audiences for Information Visualization2008
- A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations2005
- The challenge of information visualization evaluation2004
- A technique for drawing directed graphsIEEE Transactions on Software Engineering, 1993
- Automatic layout of PERT diagrams with X-PERT1989
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using Order-of-Processing (OP) diagramsJournal of Mathematical Psychology, 1983
- An Algorithm for Transitive Closure with Linear Expected TimeSIAM Journal on Computing, 1978
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973