Abstract
We present RINGS, a technique for visualizing large trees. We introduce a new ringed circular layout of nodes to make more efficient use of limited display space. RINGS provides the user with the means to specify areas of primary and secondary focus, and is able to show multiple foci without compromising understanding of the graph. The strength of RINGS is its ability to show more area in focus and more contextual information than existing techniques. We demonstrate the effectiveness of RINGS by applying it to the visualization of a Unix file directory.
| Original language | English (US) |
|---|---|
| Title of host publication | Graph Drawing - 10th International Symposium, GD 2002, Revised Papers |
| Pages | 268-275 |
| Number of pages | 8 |
| State | Published - Dec 1 2002 |
| Event | 10th International Symposium on Graph Drawing, GD 2002 - Irvine, CA, United States Duration: Aug 26 2002 → Aug 28 2002 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2528 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 10th International Symposium on Graph Drawing, GD 2002 |
|---|---|
| Country | United States |
| City | Irvine, CA |
| Period | 8/26/02 → 8/28/02 |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Teoh, S. T., & Ma, K-L. (2002). RINGS: A technique for visualizing large hierarchies. In Graph Drawing - 10th International Symposium, GD 2002, Revised Papers (pp. 268-275). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2528 LNCS).