Evaluating Partially Drawn Links for Directed Graph Edges

Burch, Michael; Vehlow, Corinna; Konevtsova, Natalia; Weiskopf, Daniel

doi:10.1007/978-3-642-25878-7_22

Cited by 38 publications

(23 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An important concept to capture the difficulties users face is cognitive load [WPCM02,HEH09]. A range of works [BVKW11,HIvWF11] are trying to mitigate this problem and present their superiority over baseline methods in controlled user experiments. A range of other challenges, including crossrepresentation comparisons, arises when studying representations of graphs that change over time [AP16].…”

Section: Summary Of Approachesmentioning

confidence: 99%

Quality Metrics for Information Visualization

Behrisch

Blumenschein

Kim

et al. 2018

Computer Graphics Forum

116

View full text Add to dashboard Cite

The visualization community has developed to date many intuitions and understandings of how to judge the quality of views in visualizing data. The computation of a visualization's quality and usefulness ranges from measuring clutter and overlap, up to the existence and perception of specific (visual) patterns. This survey attempts to report, categorize and unify the diverse understandings and aims to establish a common vocabulary that will enable a wide audience to understand their differences and subtleties. For this purpose, we present a commonly applicable quality metric formalization that should detail and relate all constituting parts of a quality metric. We organize our corpus of reviewed research papers along the data types established in the information visualization community: multi-and high-dimensional, relational, sequential, geospatial and text data. For each data type, we select the visualization subdomains in which quality metrics are an active research field and report their findings, reason on the underlying concepts, describe goals and outline the constraints and requirements. One central goal of this survey is to provide guidance on future research opportunities for the field and outline how different visualization communities could benefit from each other by applying or transferring knowledge to their respective subdomain. Additionally, we aim to motivate the visualization community to compare computed measures to the perception of humans.

show abstract

Section: Summary Of Approachesmentioning

confidence: 99%

Quality Metrics for Information Visualization

Behrisch

Blumenschein

Kim

et al. 2018

Computer Graphics Forum

116

View full text Add to dashboard Cite

show abstract

“…Burch et al [6] investigated in their study the readability of directed graphs shown with partially drawn links instead of links of full length. This approach reduces link intersections and can lead to shorter task completion times but at the cost of higher error rates.…”

Section: Related Workmentioning

confidence: 99%

Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories

Netzel

Burch

Weiskopf

2014

IEEE Trans. Visual. Comput. Graphics

Self Cite

View full text Add to dashboard Cite

We present the results of an eye tracking study that compares different visualization methods for long, dense, complex, and piecewise linear spatial trajectories. Typical sources of such data are from temporally discrete measurements of the positions of moving objects, for example, recorded GPS tracks of animals in movement ecology. In the repeated-measures within-subjects user study, four variants of node-link visualization techniques are compared, with the following representations of directed links: standard arrow, tapered, equidistant arrows, and equidistant comets. In addition, we investigate the effect of rendering order for the halo visualization of those links as well as the usefulness of node splatting. All combinations of link visualization techniques are tested for different trajectory density levels. We used three types of tasks: tracing of paths, identification of longest links, and estimation of the density of trajectory clusters. Results are presented in the form of the statistical evaluation of task completion time, task solution accuracy, and two eye tracking metrics. These objective results are complemented by a summary of subjective feedback from the participants. The main result of our study is that tapered links perform very well. However, we discuss that equidistant comets and equidistant arrows are a good option to perceive direction information independent of zoom-level of the display.

show abstract

“…Hence, classical straightline node-link drawings thereof quickly become ineffective for most, if not all, tasks they address. This is often referred to as the edge congestion [CR01, WCG03, LKS * 11], visual clutter [ED07, BVKW11,NEH13], or hairball problem [SH13]. Bundling is one class of methods that aims to alleviate this problem, along graph clustering and interaction, as further outlined in Sec.…”

Section: Definitionsmentioning

confidence: 99%

State of the Art in Edge and Trail Bundling Techniques

Lhuillier

Hurter

Telea

2017

Computer Graphics Forum

View full text Add to dashboard Cite

Bundling techniques provide a visual simplification of a graph drawing or trail set, by spatially grouping similar graph edges or trails. This way, the structure of the visualization becomes simpler and thereby easier to comprehend in terms of assessing relations that are encoded by such paths, such as finding groups of strongly interrelated nodes in a graph, finding connections between spatial regions on a map linked by a number of vehicle trails, or discerning the motion structure of a set of objects by analyzing their paths. In this state of the art report, we aim to improve the understanding of graph and trail bundling via the following main contributions. First, we propose a data‐based taxonomy that organizes bundling methods on the type of data they work on (graphs vs trails, which we refer to as paths). Based on a formal definition of path bundling, we propose a generic framework that describes the typical steps of all bundling algorithms in terms of high‐level operations and show how existing method classes implement these steps. Next, we propose a description of tasks that bundling aims to address. Finally, we provide a wide set of example applications of bundling techniques and relate these to the above‐mentioned taxonomies. Through these contributions, we aim to help both researchers and users to understand the bundling landscape as well as its technicalities.

show abstract

Evaluating Partially Drawn Links for Directed Graph Edges

Cited by 38 publications

References 16 publications

Quality Metrics for Information Visualization

Quality Metrics for Information Visualization

Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories

State of the Art in Edge and Trail Bundling Techniques

Contact Info

Product

Resources

About