RINGS: A technique for visualizing large hierarchies

Soon Tee Teoh; Kwan-Liu Ma

RINGS: A technique for visualizing large hierarchies

Soon Tee Teoh, Kwan-Liu Ma

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 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

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Fingerprint Dive into the research topics of 'RINGS: A technique for visualizing large hierarchies'. Together they form a unique fingerprint.

Cite this

RINGS : A technique for visualizing large hierarchies. / Teoh, Soon Tee; Ma, Kwan-Liu.

Graph Drawing - 10th International Symposium, GD 2002, Revised Papers. 2002. p. 268-275 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2528 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Teoh, ST & Ma, K-L 2002, RINGS: A technique for visualizing large hierarchies. in Graph Drawing - 10th International Symposium, GD 2002, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2528 LNCS, pp. 268-275, 10th International Symposium on Graph Drawing, GD 2002, Irvine, CA, United States, 8/26/02.

@inproceedings{ae539ded7ce14be2a4f2e632aaa03460,

title = "RINGS: A technique for visualizing large hierarchies",

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.",

author = "Teoh, {Soon Tee} and Kwan-Liu Ma",

year = "2002",

month = dec,

day = "1",

language = "English (US)",

isbn = "3540001581",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "268--275",

booktitle = "Graph Drawing - 10th International Symposium, GD 2002, Revised Papers",

note = "10th International Symposium on Graph Drawing, GD 2002 ; Conference date: 26-08-2002 Through 28-08-2002",

}

TY - GEN

T1 - RINGS

T2 - 10th International Symposium on Graph Drawing, GD 2002

AU - Teoh, Soon Tee

AU - Ma, Kwan-Liu

PY - 2002/12/1

Y1 - 2002/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867471013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867471013&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867471013

SN - 3540001581

SN - 9783540001584

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 275

BT - Graph Drawing - 10th International Symposium, GD 2002, Revised Papers

Y2 - 26 August 2002 through 28 August 2002

ER -