Experiments and a User Study for Hierarchical Drawings of Graphs

Abstract

We present a detailed hierarchical graph drawing technique that is based on the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Path Based Framework (PBF)</i> . 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.