2017
DOI: 10.1111/cgf.13266
|View full text |Cite
|
Sign up to set email alerts
|

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

Abstract: Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular drawing conventions like layered drawings and orthogonal drawings, and provides additional support for some common analysis tasks. We present a visualization framework called DAGView, which implements algorithms and graphical features for the OOD style. Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1
1

Relationship

3
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 66 publications
0
6
0
Order By: Relevance
“…There is a series of works that compare node-link diagrams with matrix-based representations [48], [49], [50], [51], [52], [53], [54], [55]. A common finding of these studies is that node-link diagrams have usually better performance on topology and connectivity tasks when graphs are not too large and dense, while matrices perform better on group tasks.…”
Section: User Studies In Graph Drawing and Network Visualizationmentioning
confidence: 99%
“…There is a series of works that compare node-link diagrams with matrix-based representations [48], [49], [50], [51], [52], [53], [54], [55]. A common finding of these studies is that node-link diagrams have usually better performance on topology and connectivity tasks when graphs are not too large and dense, while matrices perform better on group tasks.…”
Section: User Studies In Graph Drawing and Network Visualizationmentioning
confidence: 99%
“…Indeed, concentrating on few representative tasks is a common approach for this kind of experiments (see, e.g. [BLMT16, DKMT18, GFC04, DDL*14, PHNK12]). Our tasks are as follows:…”
Section: User Studymentioning
confidence: 99%
“…Hierarchical layout was also one of four layouts compared by Didimo et al [81] for directed graphs (see Figure 5). Specifically, overloaded orthogonal, orthogonal, hierarchical graph layouts as well as matrix representations were compared in a user study involving 21 participants.…”
Section: A: Layout Algorithmsmentioning
confidence: 99%
“…Even semantics was useful to better explore a graph [75], for example, in the form of a UML diagram [76]- [78]. Strategic exploration patterns were detected in hierarchical layouts [79]- [81] and force-directed layouts [85], also by using eye tracking, uncovering complex reading processes in radial graph diagrams [82]. Lombardi drawings are preferred [84], but due to their curved edges, they lead to bad performances.…”
Section: A: Layout Algorithmsmentioning
confidence: 99%