# A user study on visualizing directed edges in graphs

@article{Holten2009AUS, title={A user study on visualizing directed edges in graphs}, author={Danny Holten and Jarke J. van Wijk}, journal={Proceedings of the SIGCHI Conference on Human Factors in Computing Systems}, year={2009} }

Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from vertex A to B is generally visualized using an arrow representation: a (poly)line with a triangular arrowhead at vertex B. Although this representation is intuitive, it is not guaranteed that a user is able to determine edge direction as quickly and unambiguously as possible; alternative representations that exhibit… Expand

#### Figures and Topics from this paper

#### 134 Citations

A User Study on Curved Edges in Graph Visualization

- Computer Science, Medicine
- IEEE Trans. Vis. Comput. Graph.
- 2012

Two experiments studying the impact of edge curvature on graph readability show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges. Expand

A User Study on Curved Edges in Graph Visualization

- Mathematics, Computer Science
- IEEE Transactions on Visualization and Computer Graphics
- 2012

Two experiments studying the impact of edge curvature on graph readability show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges. Expand

Partial Link Drawings for Nodes, Links, and Regions of Interest

- Computer Science
- 2014 18th International Conference on Information Visualisation
- 2014

Partially drawn links in graph visualizations have been introduced as a concept for further reducing visual clutter caused by many link crossings in combination to a formerly applied layout algorithm… Expand

Performance Evaluation of Tapered, Curved, and Animated Directed-Edge Representations in Node-Link Graphs

- Mathematics
- 2010

We present the results of a study comparing three directed-edge representations in node-link diagrams. Node-link diagrams are probably the most popular type of graph representations; nodes are… Expand

Evaluating Partially Drawn Links for Directed Graph Edges

- Mathematics, Computer Science
- Graph Drawing
- 2011

It is found that partially drawn links can lead to shorter task completion times, which occurs for nearly all graph sizes, tasks, and both tapered and traditional edge representations, which in fact is task-dependent. Expand

Exploring density regions for analyzing dynamic graph data

- Computer Science
- J. Vis. Lang. Comput.
- 2018

A novel dynamic graph visualization that is based on the concept of smooth density fields generated by first splatting the link information of a given graph in a certain layout or visual metaphor is described, and the user can automatically apply region comparisons with other graphs based on global and local density properties. Expand

Isoline-Enhanced Dynamic Graph Visualization

- Computer Science
- 2016 20th International Conference Information Visualisation (IV)
- 2016

This paper describes a novel dynamic graph visualization that is based on the concept of smooth density fields generated by first splatting the links of a given graph in a certain layout and adds user-adaptable isolines to the resulting dynamic graph representation. Expand

Dynamic Graph Visualization with Multiple Visual Metaphors

- Computer Science
- VINCI
- 2015

This paper shows an idea to solve the problem of using multiple visual metaphors for dynamic graphs which are computed automatically by algorithms analyzing each individual graph based on a given repertoire of graph features. Expand

Visual analytics of large dynamic digraphs

- Computer Science
- Inf. Vis.
- 2017

This work focuses on achieving an overview about long graph sequences with the major focus to be scalable in vertex, edge, and time dimensions, and applies edge splatting as a concept to emphasize graph structures by color coding the generated density fields. Expand

Supporting graph editing in visual representations

- Computer Science
- 2016

An approach for providing navigation recommendations to interesting data is presented additionally and the concept of lenses is investigated and the applicability and suitability of the approaches developed within this thesis is demonstrated with several use cases. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES

Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2006

This paper presents a new method for visualizing compound graphs based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together and discusses the results based on an informal evaluation provided by potential users of such visualizations. Expand

Overlaying Graph Links on Treemaps

- Computer Science
- 2003

A visualization technique that displays the tree structure as aTreemap and the remaining edges as curved links overlaid on the Treemap to show where the link starts and where it ends without requiring an explicit arrow that would clutter the already dense visualization. Expand

Edgelens: an interactive method for managing edge congestion in graphs

- Computer Science
- IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)
- 2003

The EdgeLens interactively curves graph edges away for a person's focus attention without changing the node positions, which opens up sufficient space to disambiguate node and edge relationships and to see underlying information while still preserving node layout. Expand

Supporting Visual Queries on Medium-Sized Node–Link Diagrams

- Computer Science
- Inf. Vis.
- 2005

An interactive technique whereby a subset of a larger network diagram is highlighted by being set into oscillatory motion when a node is selected with a mouse, designed to support visual queries on moderately large node-link diagrams containing up to a few thousand nodes is described. Expand

Visualizing Network Data

- Computer Science
- Encyclopedia of Database Systems
- 2009

From around 1990 onwards, increased attention has been paid to interactive, or dynamic visualization of Network Data, and these techniques have surfaced in a variety of different fields, including Statistical Graphics, Information Visualization, and many applied areas. Expand

Visualizing graphs in three dimensions

- Computer Science
- TAP
- 2008

It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, prior studies were… Expand

Dynamic visualization of graphs with extended labels

- Computer Science
- IEEE Symposium on Information Visualization, 2005. INFOVIS 2005.
- 2005

A novel technique to visualize graphs with extended node and link labels that shares the visualization resources with the graph and presents the label information in static, interactive, and dynamic modes without the requirement for tackling the intractability issues. Expand

Just how dense are dense graphs in the real world?: a methodological note

- Computer Science
- BELIV '06
- 2006

This methodological note focuses on the edge density of real world examples of networks, and draws a list of conclusions on how to tune edge density when randomly generating graphs in order to build artificial though realistic examples. Expand

Thoughts on User Studies: Why, How and When

- Computer Science
- 1993

The main goal is to encourage the use of studies in visualization, but it is recognized that other disciplines also offer important insights into visualization design, for example, the areas of visual design or the visual arts. Expand

Thread Arcs: an email thread visualization

- Computer Science
- IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)
- 2003

This paper describes Thread Arcs, a novel interactive visualization technique designed to help people use threads found in email. Thread Arcs combine the chronology of messages with the branching… Expand