| Topology-aware navigation in large networks |
| Full text |
Mov
(3:40),
Pdf
(2.99 MB)
|
Source
|
Conference on Human Factors in Computing Systems
archive
Proceedings of the 27th international conference on Human factors in computing systems
table of contents
Boston, MA, USA
SESSION: Understanding graphs
table of contents
Pages 2319-2328
Year of Publication: 2009
ISBN:978-1-60558-246-7
|
|
Authors
|
|
Tomer Moscovich
|
Microsoft Research - INRIA Joint Centre, Orsay, France
|
|
Fanny Chevalier
|
Microsoft Research - INRIA Joint Centre, Orsay, France
|
|
Nathalie Henry
|
INRIA, Orsay, France
|
|
Emmanuel Pietriga
|
LRI - Univ. Paris-Sud & CNRS, Orsay, France
|
|
Jean-Daniel Fekete
|
INRIA, Orsay, France
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 60, Downloads (12 Months): 287, Citation Count: 0
|
|
|
ABSTRACT
Applications supporting navigation in large networks are used every days by millions of people. They include road map navigators, flight route visualization systems, and network visualization systems using node-link diagrams. These applications currently provide generic interaction methods for navigation: pan-and-zoom and sometimes bird's eye views. This article explores the idea of exploiting the connection information provided by the network to help navigate these large spaces. We visually augment two traditional navigation methods, and develop two special-purpose techniques. The first new technique, called "Link Sliding", provides guided panning when continuously dragging along a visible link. The second technique, called "Bring & Go", brings adjacent nodes nearby when pointing to a node. We compare the performance of these techniques in both an adjacency exploration task and a node revisiting task. This comparison illustrates the various advantages of content-aware network navigation techniques. A significant speed advantage is found for the Bring & Go technique over other methods.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
A. L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.
|
| |
3
|
P. Baudisch, E. Cutrell, D. Robbins, M. Czerwinski, P. Tandler, B. Bederson, and A. Zierlinger. Drag-and-pop and drag-and-pick: Techniques for accessing remote screen content on touch and pen-operated systems. In Proc. Interact '03, 57--64, 2003.
|
| |
4
|
|
 |
5
|
|
| |
6
|
Delta Air Lines. Delta air lines route map, 2008. http://delta.innosked.com/.
|
 |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
Google. Google maps, 2008. http://maps.google.com.
|
| |
11
|
Y. Guiard, F. Bourgeois, D. Mottet, and M. Beaudouin-Lafon. Beyond the 10-bit barrier: Fitts' law in multiscale electronic worlds. In HCI '01, 573--588. Springer, 2001.
|
 |
12
|
|
 |
13
|
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
 |
20
|
|
 |
21
|
|
 |
22
|
Bongshin Lee , Catherine Plaisant , Cynthia Sims Parr , Jean-Daniel Fekete , Nathalie Henry, Task taxonomy for graph visualization, Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, May 23-23, 2006, Venice, Italy
[doi> 10.1145/1168149.1168168]
|
 |
23
|
|
 |
24
|
|
| |
25
|
|
 |
26
|
|
 |
27
|
|
| |
28
|
|
 |
29
|
|
 |
30
|
Manojit Sarkar , Scott S. Snibbe , Oren J. Tversky , Steven P. Reiss, Stretching the rubber sheet: a metaphor for viewing large layouts on small screens, Proceedings of the 6th annual ACM symposium on User interface software and technology, p.81-91, December 1993, Atlanta, Georgia, United States
[doi> 10.1145/168642.168650]
|
| |
31
|
|
| |
32
|
J. J. van Wijk and W. A. Nuij. A model for smooth viewing and navigation of large 2d information spaces. IEEE Trans. on Visualization and Computer Graphics, 10(4):447--458, 2004.
|
| |
33
|
N. Wong, S. Carpendale, and S. Greenberg. Edgelens: An interactive method for managing edge congestion in graphs. In InfoVis'03, 51--58. IEEE Computer Society, 2003.
|
| |
34
|
|
 |
35
|
|
|