2012
DOI: 10.1117/12.920012
|View full text |Cite
|
Sign up to set email alerts
|

Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…For simpler tasks, matrix-based visualizations are generally superior for identifying connections and relationships, but for complex path-tracing type-tasks, a network diagram is sometimes a necessity (as these tasks are barely possible with the matrix format). Figure 1 below is an example from a paper at this year's SPIE conference 16 . …”
Section: Techniquesmentioning
confidence: 98%
“…For simpler tasks, matrix-based visualizations are generally superior for identifying connections and relationships, but for complex path-tracing type-tasks, a network diagram is sometimes a necessity (as these tasks are barely possible with the matrix format). Figure 1 below is an example from a paper at this year's SPIE conference 16 . …”
Section: Techniquesmentioning
confidence: 98%
“…Although an empirical evaluation of flow mapping has not been explicitly addressed in cartography, studies in the graph visualization community 412 evaluated readability and aesthetics of graph layouts and suggested various principles such as minimizing edge crossings, maintaining large crossing angles, and obtaining symmetrical layouts. The heuristics learned for general graph drawing can only give a very limited guidance for flow map design.…”
Section: Introductionmentioning
confidence: 99%