RINGS: A technique for visualizing large hierarchies

Soon Tee Teoh, Kwan-Liu Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

39 Scopus citations

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 languageEnglish (US)
Title of host publicationGraph Drawing - 10th International Symposium, GD 2002, Revised Papers
Pages268-275
Number of pages8
StatePublished - Dec 1 2002
Event10th International Symposium on Graph Drawing, GD 2002 - Irvine, CA, United States
Duration: Aug 26 2002Aug 28 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2528 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Symposium on Graph Drawing, GD 2002
CountryUnited States
CityIrvine, CA
Period8/26/028/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).