PMID- 22034346
OWN - NLM
STAT- PubMed-not-MEDLINE
DCOM- 20120224
LR  - 20120424
IS  - 1941-0506 (Electronic)
IS  - 1077-2626 (Linking)
VI  - 17
IP  - 12
DP  - 2011 Dec
TI  - Developing and evaluating Quilts for the depiction of large layered graphs.
PG  - 2268-75
LID - 10.1109/TVCG.2011.187 [doi]
AB  - Traditional layered graph depictions such as flow charts are in wide use. Yet as 
      graphs grow more complex, these depictions can become difficult to understand. 
      Quilts are matrix-based depictions for layered graphs designed to address this 
      problem. In this research, we first improve Quilts by developing three design 
      alternatives, and then compare the best of these alternatives to better-known 
      node-link and matrix depictions. A primary weakness in Quilts is their depiction 
      of skip links, links that do not simply connect to a succeeding layer. Therefore 
      in our first study, we compare Quilts using color-only, text-only, and mixed 
      (color and text) skip link depictions, finding that path finding with the 
      color-only depiction is significantly slower and less accurate, and that in 
      certain cases, the mixed depiction offers an advantage over the text-only 
      depiction. In our second study, we compare Quilts using the mixed depiction to 
      node-link diagrams and centered matrices. Overall results show that users can 
      find paths through graphs significantly faster with Quilts (46.6 secs) than with 
      node-link (58.3 secs) or matrix (71.2 secs) diagrams. This speed advantage is 
      still greater in large graphs (e.g. in 200 node graphs, 55.4 secs vs. 71.1 secs 
      for node-link and 84.2 secs for matrix depictions).
CI  - (c) 2011 IEEE
FAU - Bae, Juhee
AU  - Bae J
AD  - NC State University, USA. jbae3@ncsu.edu
FAU - Watson, Ben
AU  - Watson B
LA  - eng
PT  - Journal Article
PL  - United States
TA  - IEEE Trans Vis Comput Graph
JT  - IEEE transactions on visualization and computer graphics
JID - 9891704
EDAT- 2011/10/29 06:00
MHDA- 2011/10/29 06:01
CRDT- 2011/10/29 06:00
PHST- 2011/10/29 06:00 [entrez]
PHST- 2011/10/29 06:00 [pubmed]
PHST- 2011/10/29 06:01 [medline]
AID - 10.1109/TVCG.2011.187 [doi]
PST - ppublish
SO  - IEEE Trans Vis Comput Graph. 2011 Dec;17(12):2268-75. doi: 10.1109/TVCG.2011.187.