A Coloring Solution to the Edge Crossing Problem

Jianu, Radu; Rusu, Adrian; Fabian, Andrew J.; Laidlaw, David H.

doi:10.1109/iv.2009.66

Cited by 16 publications

(16 citation statements)

References 21 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, the more groups are present in a visualization, the harder it is to develop a set of distinct colors. A smart coloring algorithm similar to those described in [8,28,25,24] could perhaps be developed to automatically choose perceptually different colors based on group proximities. Even such approaches however would be limited by the number of groups and the intricacy of the spatial layout.…”

Section: Discussionmentioning

confidence: 99%

How to Display Group Information on Node-Link Diagrams: An Evaluation

Jianu

Rusu

et al. 2014

IEEE Trans. Visual. Comput. Graphics

Self Cite

View full text Add to dashboard Cite

This is the accepted version of the paper.This version of the publication may differ from the final published version. Abstract-We present the results of evaluating four techniques for displaying group or cluster information overlaid on node-link diagrams: node coloring, GMap, BubbleSets, and LineSets. The contributions of the paper are three fold. First, we present quantitative results and statistical analyses of data from an online study in which approximately 800 subjects performed ten types of group and network tasks in the four evaluated visualizations. Specifically, we show that BubbleSets is the best alternative for tasks involving group membership assessment; that visually encoding group information over basic node-link diagrams incurs an accuracy penalty of about 25% in solving network tasks; and that GMap's use of prominent group labels improves memorability. We also show that GMap's visual metaphor can be slightly altered to outperform BubbleSets in group membership assessment. Second, we discuss visual characteristics that can explain the observed quantitative differences in the four visualizations and suggest design recommendations. This discussion is supported by a small scale eye-tracking study and previous results from the visualization literature. Third, we present an easily extensible user study methodology. Permanent repository link

show abstract

Section: Discussionmentioning

confidence: 99%

How to Display Group Information on Node-Link Diagrams: An Evaluation

Jianu

Rusu

et al. 2014

IEEE Trans. Visual. Comput. Graphics

Self Cite

View full text Add to dashboard Cite

show abstract

“…[ZFMAQ13] optimized the colour assignment for the arcs in their Circos diagram; Jianu et al . [JRFL09] optimized the colour assignment to edges such that overlapping or close links in a node‐link diagram have perceptually opposing colours; and Chuang et al . [CWM09] used optimization in the CIELAB colour space to identify colours that are easy to distinguish in generic visualizations and that reduce the energy consumption of displays.…”

Section: Visualization Techniquementioning

confidence: 99%

Visualizing the Evolution of Communities in Dynamic Graphs

Vehlow

Beck

Auwärter

et al. 2014

Computer Graphics Forum

View full text Add to dashboard Cite

The community structure of graphs is an important feature that gives insight into the high‐level organization of objects within the graph. In real‐world systems, the graph topology is oftentimes not static but changes over time and hence, also the community structure changes. Previous timeline‐based approaches either visualize the dynamic graph or the dynamic community structure. In contrast, our approach combines both in a single image and therefore allows users to investigate the community structure together with the underlying dynamic graph. Our optimized ordering of vertices and selection of colours in combination with interactive highlighting techniques increases the traceability of communities along the time axis. Users can identify visual signatures, estimate the reliability of the derived community structure and investigate whether community evolution interacts with changes in the graph topology. The utility of our approach is demonstrated in two application examples.

show abstract

“…Bruckdorfer et al [3] investigated the influence of different parameters in visualizations with partially drawn links. Jianu et al [20] proposed color encoding of each link according to a closeness metric to address the problem of link crossings. Rusu et al [25] introduced breaks in links if intersections occur, leading to an effect similar to partially drawn links.…”

Section: Related Workmentioning

confidence: 99%

Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories

Netzel

Burch

Weiskopf

2014

IEEE Trans. Visual. Comput. Graphics

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

A Coloring Solution to the Edge Crossing Problem

Abstract: We

Cited by 16 publications

References 21 publications

How to Display Group Information on Node-Link Diagrams: An Evaluation

How to Display Group Information on Node-Link Diagrams: An Evaluation

Visualizing the Evolution of Communities in Dynamic Graphs

Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories

Contact Info

Product

Resources

About